메뉴 건너뛰기




Volumn 17, Issue 2, 1997, Pages 143-162

On recognizing and characterizing visibility graphs of simple polygons

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0031539050     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02770871     Document Type: Article
Times cited : (42)

References (22)
  • 1
    • 21844523712 scopus 로고
    • Visibility graphs of staircase polygons and the weak Bruhat order, I: From visibility graphs to maximal chains
    • J. Abello, O. Egecioglu, and K. Kumar, Visibility graphs of staircase polygons and the weak Bruhat order, I: from visibility graphs to maximal chains, Discrete & Computational Geometry, 14(3) (1995), 331-358.
    • (1995) Discrete & Computational Geometry , vol.14 , Issue.3 , pp. 331-358
    • Abello, J.1    Egecioglu, O.2    Kumar, K.3
  • 3
    • 33744637415 scopus 로고
    • Visibility graphs and oriented metroids
    • Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • J. Abello and K. Kumar, Visibility graphs and oriented metroids, Proceeding of Graph Drawing, Lecture Notes in Computer Science, Vol. 894, Springer-Verlag, Berlin, pp. 147-158, 1995.
    • (1995) Proceeding of Graph Drawing , vol.894 , pp. 147-158
    • Abello, J.1    Kumar, K.2
  • 4
  • 6
    • 33744713413 scopus 로고
    • Ph.D. Dissertation, Report No. NSO-21, Courant Institute of Mathematical Sciences, New York
    • M. A. Buckinghan, Circle graphs, Ph.D. Dissertation, Report No. NSO-21, Courant Institute of Mathematical Sciences, New York, 1980.
    • (1980) Circle Graphs
    • Buckinghan, M.A.1
  • 8
    • 0003490611 scopus 로고
    • Ph.D. Dissertation, University of Toronto, Toronto, January
    • H. Everett, Visibility graph recognition, Ph.D. Dissertation, University of Toronto, Toronto, January 1990.
    • (1990) Visibility Graph Recognition
    • Everett, H.1
  • 9
    • 0001818143 scopus 로고
    • Recognizing visibility graphs of spiral polygons
    • H. Everett and D. Corneil, Recognizing visibility graphs of spiral polygons, Journal of Algorithms, 11 (1990), 1-26.
    • (1990) Journal of Algorithms , vol.11 , pp. 1-26
    • Everett, H.1    Corneil, D.2
  • 11
    • 0000340664 scopus 로고
    • Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph
    • F. Gravil, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, SIAM Journal on Computing, 1 (1972), 180-187.
    • (1972) SIAM Journal on Computing , vol.1 , pp. 180-187
    • Gravil, F.1
  • 12
    • 0003611578 scopus 로고
    • Report JHU/EECS-86/14, The Johns Hopkins University, Baltimore
    • S. K. Ghosh, On recognizing and characterizing visibility graphs of simple polygons, Report JHU/EECS-86/14, The Johns Hopkins University, Baltimore, 1986. Also in Proceedings of the Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 318, Springer-Verlag, Berlin, pp. 96-104, 1988.
    • (1986) On Recognizing and Characterizing Visibility Graphs of Simple Polygons
    • Ghosh, S.K.1
  • 13
    • 33744569938 scopus 로고
    • Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • S. K. Ghosh, On recognizing and characterizing visibility graphs of simple polygons, Report JHU/EECS-86/14, The Johns Hopkins University, Baltimore, 1986. Also in Proceedings of the Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 318, Springer-Verlag, Berlin, pp. 96-104, 1988.
    • (1988) Proceedings of the Scandinavian Workshop on Algorithm Theory , vol.318 , pp. 96-104
  • 16
    • 0024774782 scopus 로고
    • An optimal visibility graph algorithm for triangulated simple polygon
    • J. Hershberger, An optimal visibility graph algorithm for triangulated simple polygon, Algorithmica, 4 (1989), 141-155.
    • (1989) Algorithmica , vol.4 , pp. 141-155
    • Hershberger, J.1
  • 17
    • 0018533130 scopus 로고
    • An algorithm for planning collision free paths among polygonal obstacles
    • T. Lazano-Perez and M. A. Wesley, An algorithm for planning collision free paths among polygonal obstacles, Communications of the ACM, 22 (1979), 560-570.
    • (1979) Communications of the ACM , vol.22 , pp. 560-570
    • Lazano-Perez, T.1    Wesley, M.A.2
  • 19
    • 0039397685 scopus 로고
    • Computational geometry column 18
    • J. O'Rourke, Computational geometry column 18, SIGACT News, 24 (1993), 20-25.
    • (1993) SIGACT News , vol.24 , pp. 20-25
    • O'Rourke, J.1
  • 21
    • 0039044989 scopus 로고
    • Hiding people in polygons
    • T. Shermer, Hiding people in polygons, Computing, 42 (1989), 109-132.
    • (1989) Computing , vol.42 , pp. 109-132
    • Shermer, T.1
  • 22
    • 51249169254 scopus 로고
    • A new necessary condition for the vertex visibility graphs of simple polygons
    • G. Srinivasaraghavan and A. Mukhopadhyay, A new necessary condition for the vertex visibility graphs of simple polygons, Discrete & Computational Geometry, 12 (1994), 65-82.
    • (1994) Discrete & Computational Geometry , vol.12 , pp. 65-82
    • Srinivasaraghavan, G.1    Mukhopadhyay, A.2


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