Degree Bounds for Constrained Pseudo-Triangulations

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.

• Type: Conference
• Year: 2003
• Where: CCCG
• Authors: Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
• Keywords: CCCG 2003, CCCG 2007, Planar Straight Line, Pointed Pseudo-triangulation Tg, Vertex Degree