Which triangulations approximate the complete graph?
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 168-192
- https://doi.org/10.1007/3-540-51859-2_15
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Delaunay graphs are almost as good as complete graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- There is a planar graph almost as good as the complete graphPublished by Association for Computing Machinery (ACM) ,1986
- On approximation behavior and implementation of the greedy triangulation for convex planar point setsPublished by Association for Computing Machinery (ACM) ,1986
- 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