메뉴 건너뛰기




Volumn 31, Issue 3, 2005, Pages 195-206

Non-stretchable pseudo-visibility graphs

Author keywords

Oriented matroid; Pseudo visibility graph; Pseudoline arrangement; Stretchability; Visibility graph

Indexed keywords


EID: 84867956205     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.12.003     Document Type: Article
Times cited : (18)

References (16)
  • 1
    • 33744637415 scopus 로고
    • Visibility graphs and oriented matroids
    • R. Tamassia, I.G. Tollis, Lecture Notes in Computer Science Springer Berlin Full version in Discrete Computational Geometry 28 2002 449 465
    • J. Abello, and K. Kumar Visibility graphs and oriented matroids R. Tamassia, I.G. Tollis, Graph Drawing (Proc. GD '94) Lecture Notes in Computer Science vol. 894 1995 Springer Berlin 147 158 Full version in Discrete Computational Geometry 28 2002 449 465
    • (1995) Graph Drawing (Proc. GD '94) , vol.894 , pp. 147-158
    • Abello, J.1    Kumar, K.2
  • 3
    • 0039719221 scopus 로고
    • Oriented Matroids
    • P. Gruber, J. Wills, North Holland Amsterdam
    • J. Bokowski Oriented Matroids P. Gruber, J. Wills, Handbook of Convex Geometry, vol. A 1993 North Holland Amsterdam 555 602
    • (1993) Handbook of Convex Geometry, Vol. A , pp. 555-602
    • Bokowski, J.1
  • 4
    • 0035645211 scopus 로고    scopus 로고
    • On the Folkman-Lawrence topological representation theorem for oriented matroids in rank 3
    • J. Bokowski, S. Mock, and I. Streinu On the Folkman-Lawrence topological representation theorem for oriented matroids in rank 3 European J. Combinatorics 22 5 2001 601 615
    • (2001) European J. Combinatorics , vol.22 , Issue.5 , pp. 601-615
    • Bokowski, J.1    Mock, S.2    Streinu, I.3
  • 5
    • 0003490611 scopus 로고
    • Ph.D. thesis, Computer Science Department, University of Toronto
    • H. Everett, Visibility graph recognition, Ph.D. thesis, Computer Science Department, University of Toronto, 1989
    • (1989) Visibility Graph Recognition
    • Everett, H.1
  • 6
    • 33750737643 scopus 로고
    • Negative results on characterizing visibility graphs
    • H. Everett, and D. Corneil Negative results on characterizing visibility graphs Computational Geometry 5 1995 51 63
    • (1995) Computational Geometry , vol.5 , pp. 51-63
    • Everett, H.1    Corneil, D.2
  • 7
    • 0031539050 scopus 로고    scopus 로고
    • On recognizing and characterizing visibility graphs of simple polygons
    • Preliminary version Proc. 1st Scand. Workshop Algorithm Theory Lecture Notes in Computer Science vol. 318 1988 Springer Berlin 96 104
    • S.K. Ghosh On recognizing and characterizing visibility graphs of simple polygons Discrete Comput. Geom. 17 1997 143 162 Preliminary version Proc. 1st Scand. Workshop Algorithm Theory Lecture Notes in Computer Science vol. 318 1988 Springer Berlin 96 104
    • (1997) Discrete Comput. Geom. , vol.17 , pp. 143-162
    • Ghosh, S.K.1
  • 8
    • 0042114354 scopus 로고
    • On the combinatorial classification of non-degenerate configurations in the plane
    • J.E. Goodman, and R. Pollack On the combinatorial classification of non-degenerate configurations in the plane J. Combin. Theory Ser. A 29 1980 220 235
    • (1980) J. Combin. Theory Ser. A , vol.29 , pp. 220-235
    • Goodman, J.E.1    Pollack, R.2
  • 9
    • 0041103519 scopus 로고
    • Semispaces of configurations, cell complexes of arrangements
    • J.E. Goodman, and R. Pollack Semispaces of configurations, cell complexes of arrangements J. Combin. Theory Ser. A 37 1984 257 293
    • (1984) J. Combin. Theory Ser. A , vol.37 , pp. 257-293
    • Goodman, J.E.1    Pollack, R.2
  • 10
    • 0001302946 scopus 로고
    • Allowable sequences and order types in discrete and computational geometry
    • J. Pach, Springer Berlin
    • J.E. Goodman, and R. Pollack Allowable sequences and order types in discrete and computational geometry J. Pach, New Trends in Discrete and Computational Geometry 1993 Springer Berlin
    • (1993) New Trends in Discrete and Computational Geometry
    • Goodman, J.E.1    Pollack, R.2
  • 11
    • 33744602382 scopus 로고
    • The universality theorem on the oriented matroid stratification of the space of real matrices
    • J. Goodman, R. Pollack, W. Steiger, AMS/ACM DIMACS Series in Discrete Math. and Theoretical Computer Science
    • N. Mnëv The universality theorem on the oriented matroid stratification of the space of real matrices J. Goodman, R. Pollack, W. Steiger, Discrete and Computational Geometry, DIMACS Special Year AMS/ACM DIMACS Series in Discrete Math. and Theoretical Computer Science vol. 6 1991
    • (1991) Discrete and Computational Geometry, DIMACS Special Year , vol.6
    • Mnëv, N.1
  • 13
    • 0040531874 scopus 로고    scopus 로고
    • The vertex-edge visibility graph of a polygon
    • J. O'Rourke, and I. Streinu The vertex-edge visibility graph of a polygon Computational Geometry 10 2 1998 105 120
    • (1998) Computational Geometry , vol.10 , Issue.2 , pp. 105-120
    • O'Rourke, J.1    Streinu, I.2
  • 14
    • 0000652234 scopus 로고
    • Stretchability of pseudolines is NP-hard
    • P. Gritzmann, B. Sturmfels, DIMACS Series in Discrete Math. and Theoretical Computer Science
    • P. Shor Stretchability of pseudolines is NP-hard P. Gritzmann, B. Sturmfels, Applied Geometry and Discrete Mathematics, the Victor Klee Festscrift DIMACS Series in Discrete Math. and Theoretical Computer Science vol. 4 1991
    • (1991) Applied Geometry and Discrete Mathematics, the Victor Klee Festscrift , vol.4
    • Shor, P.1


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