Visibility graphs and oriented matroids (extended abstract)

  • James Abello
  • Krishna Kumar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)

Abstract

This paper describes a new set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank 3 oriented matroid can be constructed in polynomial time, which if affinely co- ordinatizable would yield a simple polygon whose visibility graph is isomorphic to the given graph. This will in turn offer the first characterization of this class of graphs.

References

  1. 1.
    J. Abello, O. Egecioglu, Visibility Graphs of Staircase Polygons with Uniform Step Length, International Journal of Discrete and Computational Geometry, 3 (1993) pp. 27–37.Google Scholar
  2. 2.
    J. Abello, L. Hua, C. Pisupati, On Visibility Graphs of Simple Polygons, Congressus Numerantium, 90 (1992), pp. 119–128.Google Scholar
  3. 3.
    J.Abello, O.Egecioglu, K.Kumar, Visibility Graphs of Staircase Polygons and the Weak Bruhat Order I: From Visibility Graphs to Maximal Chains, Discrete and Computational Geometry, Accepted (pending revisions).Google Scholar
  4. 4.
    J.Abello, K.Kumar, Visibility Graphs and Oriented Matroids (Long Version), Manuscript.Google Scholar
  5. 5.
    B. Aronov, On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon, Algorithmica, 4 (1989) pp. 109–140.Google Scholar
  6. 6.
    J. Bokowski, B. Sturmfels, Computational Synthetic Geometry, Lecture Notes in Mathematics, 1335 (1989), Springer-Verlag, New York.Google Scholar
  7. 7.
    J. Canny, Some Algebraic and Geometric Computations in PSPACE, Proceedings of the 20th ACM Symposium on Theory of Computing, 1988, pp. 460–467.Google Scholar
  8. 8.
    C. Coullard and A. Lubiw, Distance Visibility Graphs, Proceedings of the ACM Symposium on Computational Geometry, 1991, pp. 290–302.Google Scholar
  9. 9.
    H. Everett, Visibility Graph Recognition, PhD Dissertation, Department of Computer Science, University of Toronto, 1990.Google Scholar
  10. 10.
    J. Folkman, J. Lawrence, Oriented Matroids, Journal of Combinatorial Theory (B), 25 (1978), pp. 199–236.Google Scholar
  11. 11.
    S.K. Ghosh, On Recognizing and Characterizing Visibility Graphs of Simple Polygons, Lecture Notes in Computer Science, 318 (1988), pp. 132–139, Springer-Verlag, New York.Google Scholar
  12. 12.
    J.E. Goodman, R. Pollack, “Semispaces of Configurations, Cell Complexes of Arrangements,” Journal of Combinatorial Theory (A), (37) pp. 84–102, 1984.Google Scholar
  13. 13.
    N. Greene, M. Kass, and G. Miller, Hierarchical Z-buffer Visibility, SIGGRAPH 93 Proceedings, pp 231–238, 1993.Google Scholar
  14. 14.
    K. Kumar, Combinatorial Aspects of Point Visibility, PhD. Dissertation, Dept.. of Computer Science, Texas A&M University, August 1993.Google Scholar
  15. 15.
    J. Lawrence, Oriented Matroids and Multiply Ordered Sets, Linear Algebra and its Applications, 48 (1982) pp. 1–12.Google Scholar
  16. 16.
    T. Lozano-Perez and M. A. Wesley “An Algorithm for Planning Collision-Free Paths among Polyhedral Obstacles,” Communications of the ACM, (22) pp. 560–570, 1979.Google Scholar
  17. 17.
    N.E. Mnëv, The Universality Theorems on the Classification Problem of Configuration Varieties and Convex Polytope Varieties, Lecture Notes in Mathematics, 1346 (1988), pp. 527–544, Springer-Verlag, New York.Google Scholar
  18. 18.
    J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, 1987.Google Scholar
  19. 19.
    J. O'Rourke, The Computational Geometry Column, SIGACT News, (1992).Google Scholar
  20. 20.
    P.W. Shor, Stretchability of Pseudolines is NP-Hard, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 4 (1991), pp. 531–554.Google Scholar
  21. 21.
    S. Teller, P. Hanrahan, Global Visibility Algorithms for Illumination Computations, SIGGRAPH 93 Proceedings, pp 239–246, 1993.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • James Abello
    • 1
  • Krishna Kumar
    • 2
  1. 1.Department of Computer ScienceTexas A&M UniversityCollege StationUSA
  2. 2.Department of Mathematics and Computer ScienceColby CollegeWatervilleUSA

Personalised recommendations