Journal article
POINT VISIBILITY GRAPHS AND -CONVEX COVER
Abstract
A visibility relation can be viewed as a graph: the uncountable graph of a visibility relationship between points in a polygon P is called the point visibility graph (PVG) of P. In this paper we explore the use of perfect graphs to characterize tractable subproblems of visibility problems. Our main result is a characterization of which polygons are guaranteed to have weakly triangulated PVGs, under a generalized notion of visibility called …
Authors
BREMNER D; SHERMER T
Journal
International Journal of Computational Geometry & Applications, Vol. 10, No. 01, pp. 55–71
Publisher
World Scientific Publishing
Publication Date
February 2000
DOI
10.1142/s0218195900000048
ISSN
0218-1959