Abstract
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S,E). For the case that G forms a simple polygon P with vertex set S we give tight bounds on the vertex degree of TG.
Original language | English |
---|---|
Title of host publication | Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG'03, Halifax, Nova Scotia, Canada, August 11-13, 2003), Electronic proceedings |
Pages | 155-158 |
Publication status | Published - 2003 |