Degree bounds for constrained pseudo-triangulations

O. Aichholzer, M. Hoffmann, B. Speckmann, Cs.D. Tóth

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


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 languageEnglish
Title of host publicationProceedings of the 15th Canadian Conference on Computational Geometry (CCCG'03, Halifax, Nova Scotia, Canada, August 11-13, 2003), Electronic proceedings
Publication statusPublished - 2003


Dive into the research topics of 'Degree bounds for constrained pseudo-triangulations'. Together they form a unique fingerprint.

Cite this