A space efficient greedy triangulation algorithm
- 1 May 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (4) , 191-196
- https://doi.org/10.1016/0020-0190(89)90122-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On approximation behavior of the greedy triangulation for convex polygonsAlgorithmica, 1987
- An ω(√n) lower bound for the nonoptimality of the greedy triangulationInformation Processing Letters, 1987
- Generalized delaunay triangulation for planar graphsDiscrete & Computational Geometry, 1986