Skip to main content
Subquadratic nonobtuse triangulation of convex polygons
- Author(s): Eppstein, David
- et al.
A convex polygon with n sides can be triangulated by O(n^1.85) triangles, without any obtuse angles. The construction uses a novel form of geometric divide and conquer.
For improved accessibility of PDF content, download the file to your device.