Non-Stretchable Pseudo-Visibility Graphs

Authors

Ileana Streinu, Smith CollegeFollow

Document Type

Article

Publication Date

6-1-2005

Publication Title

Computational Geometry: Theory and Applications

Abstract

We exhibit a family of graphs which can be realized as pseudo-visibility graphs of pseudo-polygons, but not of straight-line polygons. The example is based on the characterization of vertex-edge pseudo-visibility graphs of O'Rourke and Streinu [Proc. ACM Symp. Comput. Geometry, Nice, France, 1997, pp. 119-128] and extends a recent result of the author [Proc. ACM Symp. Comput. Geometry, Miami Beach, 1999, pp. 274-280] on non-stretchable vertex-edge visibility graphs. We construct a pseudo-visibility graph for which there exists a unique compatible vertex-edge visibility graph, which is then shown to be non-stretchable. The construction is then extended to an infinite family. © 2004 Elsevier B.V.

Keywords

Oriented matroid, Pseudo-visibility graph, Pseudoline arrangement, Stretchability, Visibility graph

Volume

31

Issue

3

First Page

195

Last Page

206

DOI

10.1016/j.comgeo.2004.12.003

ISSN

09257721

Comments

Archived as published.

Recommended Citation

Streinu, Ileana, "Non-Stretchable Pseudo-Visibility Graphs" (2005). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/309