Drawing Planar Graphs on Points Inside a Polygon
暂无分享,去创建一个
[1] K. Wagner. Bemerkungen zum Vierfarbenproblem. , 1936 .
[2] Roberto Tamassia,et al. On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..
[3] Emilio Di Giacomo,et al. Drawing colored graphs on colored points , 2008, Theor. Comput. Sci..
[4] János Pach,et al. Embedding Planar Graphs at Fixed Vertex Locations , 1998, Graph Drawing.
[5] Norishige Chiba,et al. The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs , 1989, J. Algorithms.
[6] Christian Bachmaier,et al. Cyclic Level Planarity Testing and Embedding , 2007, Graph Drawing.
[7] János Pach,et al. How to draw a planar graph on a grid , 1990, Comb..
[8] Emilio Di Giacomo,et al. Constrained Point-Set Embeddability of Planar Graphs , 2008, Graph Drawing.
[9] Walter Schnyder,et al. Embedding planar graphs on the grid , 1990, SODA '90.
[10] Thomas Lengauer,et al. Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.