暂无分享,去创建一个
[1] J. Pach,et al. Representation of planar graphs by segments , 1994 .
[2] Patrice Ossona de Mendez,et al. On Triangle Contact Graphs , 1994, Combinatorics, Probability and Computing.
[3] Carsten Thomassen,et al. Interval representations of planar graphs , 1986, J. Comb. Theory, Ser. B.
[4] Edwin Kinnen,et al. Rectangular duals of planar graphs , 1985, Networks.
[5] David Eppstein,et al. Balanced Circle Packings for Planar Graphs , 2014, Graph Drawing.
[6] Emilio Di Giacomo,et al. 1-Bend Upward Planar Drawings of SP-Digraphs , 2016, Graph Drawing.
[7] Anna Lubiw,et al. Morphing orthogonal planar graph drawings , 2013, SODA '06.
[8] Sartaj Sahni,et al. A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.
[9] Stefan Felsner,et al. Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations , 2013, Algorithmica.
[10] Roberto Tamassia,et al. On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..
[11] Stephane Durocher,et al. On Balanced ✛-Contact Representations , 2013, Graph Drawing.
[12] Éric Fusy,et al. Transversal structures on triangulations: A combinatorial study and straight-line drawings , 2006, Discret. Math..
[13] Michael Kaufmann,et al. Area-Efficient Static and Incremental Graph Drawings , 1997, ESA.
[14] Ioannis G. Tollis,et al. Efficient Orthogonal Drawings of High Degree Graphs , 2000, Algorithmica.
[15] David R. Wood,et al. Multi-dimensional Orthogonal Graph Drawing with Small Boxes , 1999, GD.
[16] Michael Kaufmann,et al. Optimal Polygonal Representation of Planar Graphs , 2010, LATIN.
[17] Stephen G. Kobourov,et al. Combinatorial and Geometric Properties of Planar Laman Graphs , 2012, SODA.
[18] Goos Kant,et al. A Better Heuristic for Orthogonal Graph Drawings , 1994, ESA.
[19] Debajyoti Mondal,et al. Touching Triangle Representations for 3-Connected Planar Graphs , 2012, GD.
[20] Ioannis G. Tollis,et al. Planar grid embedding in linear time , 1989 .