暂无分享,去创建一个
[1] Stephen K. Wismath,et al. Characterizing bar line-of-sight graphs , 1985, SCG '85.
[2] Viggo Kann,et al. Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..
[3] Christina Koch,et al. Obstacle Numbers of Graphs , 2010, Discret. Comput. Geom..
[4] Roberto Tamassia,et al. A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..
[5] János Pach,et al. Graphs with no grid obstacle representation , 2016 .
[6] Michael Kaufmann,et al. Drawing Planar Partitions II: HH-Drawings , 1998, WG.
[7] Therese C. Biedl,et al. Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs , 2011, Discret. Comput. Geom..
[8] Giuseppe Di Battista,et al. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees , 1992, Comput. Geom..
[9] Robert E. Tarjan,et al. Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..
[10] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[11] Therese C. Biedl,et al. Height-Preserving Transformations of Planar Graph Drawings , 2014, GD.
[12] Pat Morin,et al. On Obstacle Numbers , 2013, Electron. J. Comb..
[13] Rajeev Motwani,et al. Covering orthogonal polygons with star polygons: the perfect graph approach , 1988, SCG '88.
[14] Simeon C. Ntafos,et al. Covering Grids and Orthogonal Polygons with Periscope Guards , 1992, Comput. Geom..
[15] János Pach,et al. How to draw a planar graph on a grid , 1990, Comb..