Visibility graphs and oriented matroids

Discrete and Computational Geometry

Volumn 28, Issue 4, 2002, Pages 449-465

  Abello, James ^a   Kumar, Krishna ^b  

^a AT AND T LABS RESEARCH   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036883302     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2881-6     Document Type: Article

References (23)

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