Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition

@inproceedings{ORourke1997VertexEdgePG,
  title={Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition},
  author={Joseph O'Rourke and Ileana Streinu},
  booktitle={Symposium on Computational Geometry},
  year={1997}
}
We extend the notion of polygon visibility graphs to pseud~polygons defined on genemlized conjigumtions Of points. We consider both vertex-to-vertex, as well as vertex-to-edge visibility in pseudo-polygons. We study the characterization and recognition problems for vertex-edge pseudo-visibility graphs. Given a bipart.ite graph G satisfying three simple properties, which can all be checked in polynomial time, we show that we can define a generalized configuration of points and a pseudo-polygon… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

References

Publications referenced by this paper.

Revised Apr

January
1996. • 1996
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…