An ω(√n) lower bound for the nonoptimality of the greedy triangulation
Information Processing Letters
A heuristic triangulation algorithm
Journal of Algorithms
Globally-Equiangular triangulations of co-circular points in 0(n log n) time
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Fast algorithms for greedy triangulation
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Approximation algorithms for planar traveling salesman tours and minimum-length triangulations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The farthest point Delaunay triangulation minimizes angles
Computational Geometry: Theory and Applications
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Triangulating polygons without large angles
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Navigating through triangle meshes implemented as linear quadtrees
ACM Transactions on Graphics (TOG)
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
In O(n log n) time we compute a triangulation with O(n) new points, and no obtuse triangles, that has length within a constant factor of the minimum possible. We also approximate the minimum weight Steiner triangulation using triangulations with no sharp angles. No previous polyonomial time triangulation achieved an approximation factor better than O(log n).