Visibility Graphs and Oriented Matroids

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.

[1]  Gavin S. P. Miller,et al.  Hierarchical Z-buffer visibility , 1993, SIGGRAPH.

[2]  B. Sturmfels.  Computational Synthetic Geometry , 1989 .

[3]  Seth J. Teller,et al.  Global visibility algorithms for illumination computations , 1993, SIGGRAPH.

[4]  Richard Pollack,et al.  Semispaces of Configurations, Cell Complexes of Arrangements , 1984, J. Comb. Theory, Ser. A.

[5]  Subir Kumar Ghosh.  On Recognizing and Characterizing Visibility Graphs of Simple Polygons , 1988, SWAT.

[6]  Ömer Egecioglu,et al.  Visibility graphs of staircase polygons and the weak Bruhat order, I: From visibility graphs to maximal chains , 1995, Discret. Comput. Geom..

[7]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[8]  Peter W. Shor,et al.  Stretchability of Pseudolines is NP-Hard , 1990, Applied Geometry And Discrete Mathematics.

[9]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[10]  Jim Lawrence,et al.  Oriented matroids and multiply ordered sets , 1982 .

[11]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[12]  Derek G. Corneil,et al.  Visibility graph recognition , 1990 .

[13]  Herbert Edelsbrunner,et al.  Semispaces of Configurations , 1987 .

[14]  Krishna Kumar.  Combinatorial aspects of point visibility , 1993 .

[15]  Jim Lawrence,et al.  Oriented matroids , 1978, J. Comb. Theory B.

[16]  Collette R. Coullard,et al.  Distance visibility graphs , 1991, SCG '91.

[17]  Boris Aronov.  On the geodesic Voronoi diagram of point sites in a simple polygon , 1987, SCG '87.

[18]  N. Mnev.  The universality theorems on the classification problem of configuration varieties and convex polytopes varieties , 1988 .

[19]  B. Sturmfels.  Oriented Matroids , 1993 .

[20]  Ömer Egecioglu,et al.  Visibility graphs of staircase polygons with uniform step length , 1993, Int. J. Comput. Geom. Appl..