Segment endpoint visibility graphs are Hamiltonian

Computational Geometry: Theory and Applications

Volumn 26, Issue 1, 2003, Pages 47-68

  Hoffmann, Michael ^a   Tóth, Csaba D ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Hamiltonian graph; Line segments; Visibility graph

Indexed keywords

EID: 84867955842     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00172-4     Document Type: Conference Paper

References (20)

1. P.K. Agarwal, N. Alon, B. Aronov, and S. Suri Can visibility graphs be represented compactly? Discrete Comput. Geom. 12 1994 347 365
2. T. Asano, S.K. Ghosh, and T.C. Shermer Visibility in the plane J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Science/North-Holland Amsterdam 829 876
3. P. Bose, M.E. Houle, and G.T. Toussaint Every set of disjoint line segments admits a binary tree Discrete Comput. Geom. 26 2001 387 410
4. E.D. Demaine, and J. O'Rourke Open problems from CCCG'99 Proc. 12th Canadian Conf. Comput. Geom., Fredericton, NB 2000 269 272
5. H. Everett, C.T. Hoang, K. Kilakos, and M. Noy Planar segment visibility graphs Computational Geometry 16 2000 235 243
6. S. Ghali, and A.J. Stewart Maintenance of the set of segments visible from a moving viewpoint in two dimensions Proc. 12th Annu. ACM Sympos. Comput. Geom., Philadelphia, PA 1996 V3 V4
7. S.K. Ghosh, and D.M. Mount An output-sensitive algorithm for computing visibility graphs SIAM J. Comput. 20 1991 888 910
8. M. Hoffmann, and Cs.D. Tóth Alternating paths through disjoint line segments Abstracts 18th European Workshop Comput. Geom., Warsaw 2002 23 26
9. M. Keil, D.M. Mount, and S.K. Wismath Visibility stabs and depth-first spiralling on line segments in output sensitive time Internat. J. Comput. Geom. Appl. 10 2000 535 552
10. A. Mirzaian Hamiltonian triangulations and circumscribing polygons of disjoint line segments Computational Geometry 2(1) 1992 15 30
11. J. O'Rourke J.E. Goodman, J. O'Rourke, Handbook of Discrete and Computational Geometry 1997 CRC Press LLC Boca Raton, FL 467 480 Chapter 25
12. J. O'Rourke, and J. Rippel Two segment classes with Hamiltonian visibility graphs Computational Geometry 4 1994 209 218
13. M.H. Overmars, and E. Welzl New methods for computing visibility graphs Proc. 4th Annu. ACM Sympos. Comput. Geom., Urbana-Champaign, IL 1988 164 171
14. M. Pocchiola, and G. Vegter Minimal tangent visibility graphs Computational Geometry 6 1996 303 314
15. M. Pocchiola, and G. Vegter Topologically sweeping visibility complexes via pseudo-triangulations Discrete Comput. Geom. 16 1996 419 453
16. D. Rappaport Computing simple circuits from a set of line segments is NP-complete SIAM J. Comput. 18 6 1989 1128 1139
17. D. Rappaport, H. Imai, and G.T. Toussaint Computing simple circuits from a set of line segments Discrete Comput. Geom. 5 3 1990 289 304
18. X. Shen, and H. Edelsbrunner A tight lower bound on the size of visibility graphs Inform. Process. Lett. 26 1987 61 64
19. M. Urabe, and M. Watanabe On a counterexample to a conjecture of Mirzaian Computational Geometry 2 1 1992 51 53
20. 2) time Inform. Process. Lett. 20 1985 167 171