An ω(√n) lower bound for the nonoptimality of the greedy triangulation
- 17 June 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (4) , 247-251
- https://doi.org/10.1016/0020-0190(87)90170-0
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On approximation behavior of the greedy triangulation for convex polygonsAlgorithmica, 1987
- The Greedy and Delauney triangulations are not bad in the average caseInformation Processing Letters, 1986
- A note on Delaunay and optimal triangulationsInformation Processing Letters, 1980
- Minimal Triangulations of Polygonal DomainsPublished by Elsevier ,1980
- Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulationInformation Processing Letters, 1979