Degree Bounds for Constrained Pseudo-Triangulations
Oswin Aichholzer, Hoffmann, M, Bettina Speckmann, Csaba D. Tóth · TU/e Research Portal · 2003
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.