On the Number of Empty Pseudo-Triangles in Point Sets

We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where they are not fixed. Furthermore, the pseudo-triangles must either be star-shaped or can be arbitrary.

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Marc J. van Kreveld, Bettina Speckmann
• Keywords: CCCG 2007, Computational Geometry, Convex Vertices, Maximum Number, Planar Point