On approximation behavior of the greedy triangulation for convex polygons
- 1 November 1987
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 2 (1-4) , 175-193
- https://doi.org/10.1007/bf01840358
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On approximation behavior and implementation of the greedy triangulation for convex planar point setsPublished by Association for Computing Machinery (ACM) ,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
- A note on the all nearest-neighbor problem for convex polygonsInformation Processing Letters, 1979
- The all nearest-neighbor problem for convex polygonsInformation Processing Letters, 1978
- On triangulations of a set of points in the planePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969