Skip to main content
Open Access Publications from the University of California

Subquadratic nonobtuse triangulation of convex polygons


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.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View