메뉴 건너뛰기




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

Segment endpoint visibility graphs are Hamiltonian

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
Times cited : (27)

References (20)
  • 2
    • 0038673236 scopus 로고    scopus 로고
    • Visibility in the plane
    • J.-R. Sack, J. Urrutia, Elsevier Science/North-Holland Amsterdam
    • 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
    • (2000) Handbook of Computational Geometry , pp. 829-876
    • Asano, T.1    Ghosh, S.K.2    Shermer, T.C.3
  • 3
    • 0035645567 scopus 로고    scopus 로고
    • Every set of disjoint line segments admits a binary tree
    • 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
    • (2001) Discrete Comput. Geom. , vol.26 , pp. 387-410
    • Bose, P.1    Houle, M.E.2    Toussaint, G.T.3
  • 7
    • 0026239341 scopus 로고
    • An output-sensitive algorithm for computing visibility graphs
    • S.K. Ghosh, and D.M. Mount An output-sensitive algorithm for computing visibility graphs SIAM J. Comput. 20 1991 888 910
    • (1991) SIAM J. Comput. , vol.20 , pp. 888-910
    • Ghosh, S.K.1    Mount, D.M.2
  • 9
    • 0034368240 scopus 로고    scopus 로고
    • Visibility stabs and depth-first spiralling on line segments in output sensitive time
    • 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
    • (2000) Internat. J. Comput. Geom. Appl. , vol.10 , pp. 535-552
    • Keil, M.1    Mount, D.M.2    Wismath, S.K.3
  • 10
    • 38249008298 scopus 로고
    • Hamiltonian triangulations and circumscribing polygons of disjoint line segments
    • A. Mirzaian Hamiltonian triangulations and circumscribing polygons of disjoint line segments Computational Geometry 2(1) 1992 15 30
    • (1992) Computational Geometry , vol.2 , Issue.1 , pp. 15-30
    • Mirzaian, A.1
  • 11
  • 12
    • 0001589865 scopus 로고
    • Two segment classes with Hamiltonian visibility graphs
    • J. O'Rourke, and J. Rippel Two segment classes with Hamiltonian visibility graphs Computational Geometry 4 1994 209 218
    • (1994) Computational Geometry , vol.4 , pp. 209-218
    • O'Rourke, J.1    Rippel, J.2
  • 15
    • 0030519977 scopus 로고    scopus 로고
    • Topologically sweeping visibility complexes via pseudo-triangulations
    • M. Pocchiola, and G. Vegter Topologically sweeping visibility complexes via pseudo-triangulations Discrete Comput. Geom. 16 1996 419 453
    • (1996) Discrete Comput. Geom. , vol.16 , pp. 419-453
    • Pocchiola, M.1    Vegter, G.2
  • 16
    • 0024881354 scopus 로고
    • Computing simple circuits from a set of line segments is NP-complete
    • D. Rappaport Computing simple circuits from a set of line segments is NP-complete SIAM J. Comput. 18 6 1989 1128 1139
    • (1989) SIAM J. Comput. , vol.18 , Issue.6 , pp. 1128-1139
    • Rappaport, D.1
  • 17
    • 0039746344 scopus 로고
    • Computing simple circuits from a set of line segments
    • 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
    • (1990) Discrete Comput. Geom. , vol.5 , Issue.3 , pp. 289-304
    • Rappaport, D.1    Imai, H.2    Toussaint, G.T.3
  • 18
    • 0023439928 scopus 로고
    • A tight lower bound on the size of visibility graphs
    • X. Shen, and H. Edelsbrunner A tight lower bound on the size of visibility graphs Inform. Process. Lett. 26 1987 61 64
    • (1987) Inform. Process. Lett. , vol.26 , pp. 61-64
    • Shen, X.1    Edelsbrunner, H.2
  • 19
    • 38249007708 scopus 로고
    • On a counterexample to a conjecture of Mirzaian
    • M. Urabe, and M. Watanabe On a counterexample to a conjecture of Mirzaian Computational Geometry 2 1 1992 51 53
    • (1992) Computational Geometry , vol.2 , Issue.1 , pp. 51-53
    • Urabe, M.1    Watanabe, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.