Triangulations with many points of even degree

Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangulation of S containing at least 2n 3 -3 points with even degree; this improves slightly the bound of 2(n-1) 3 - 6 by Aichholzer et. al. [1]. Our proof can be easily adapted to give, through a long case analysis, triangulations with 4n 5 - c vertices with even degree.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Jorge Urrutia, Canek Peláez, Adriana Ramírez-Viguer
• Keywords: Aichholzer Et, CCCG 2010, Computational Geometry, General Position, Triangulation