Nonobtuse triangulation of polygons
Discrete & Computational Geometry
An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Polynomial-size nonobtuse triangulation of polygons
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Approximating the minimum weight triangulation
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An upper bound for conforming Delaunay triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Quality mesh generation in three dimensions
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Edge Insertion for Optional Triangulations
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Linear-size nonobtuse triangulation of polygons
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An optimal bound for conforming quality triangulations: (extended abstract)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Atomic volumes for mesh completion
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
| Hi-index | 0.00 |
We show how to triangulate an n-vertex polygonal region—adding extra vertices as necessary—with triangles of guaranteed quality. Using only O(n) triangles, we can guarantee that the smallest height (shortest dimension) of a triangle is approximately as large as possible. Using O(n log n) triangles, we can also guarantee that the largest angle is no greater than 150°. Finally we give a nonobtuse triangulation algorithm for convex polygons that uses O(n1.85) triangles.