论文信息 - On the minimum size of visibility graphs - 字舞流文

On the minimum size of visibility graphs

In this paper we give tight lower bounds on the size of the visibility graph, the contracted visibility graph, and the bar-visibility graph of n disjoint line segments in the plane, according to their vertex-connectivity.

Marc Noy | Ferran Hurtado | Alfredo García Olaverri | Javier Tejel

[1] Jay Bagga,et al. Contracted visibility graphs of line segments , 1997, CCCG.

[2] Michel Pocchiola,et al. Minimal Tangent Visibility Graphs , 1996, Comput. Geom..

[3] Chak-Kuen Wong,et al. A note on visibility graphs , 1987, Discret. Math..

[4] Hazel Everett,et al. Planar segment visibility graphs , 2000, Comput. Geom..

[5] Marc Noy,et al. Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon , 1996, Comput. Geom..

[6] Jorge Urrutia. On the number of internal and external visibility edges of polygons , 1997, CCCG.

[7] Xiaojun Shen,et al. A Tight Lower Bound on the Size of Visibility Graphs , 1987, Inf. Process. Lett..

[8] Joseph O'Rourke. Computational geometry column 18 , 1993, Int. J. Comput. Geom. Appl..