Approximating the minimum weight steiner triangulation
- 1 January 1994
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 11 (2) , 163-191
- https://doi.org/10.1007/bf02574002
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- The farthest point Delaunay triangulation minimizes anglesComputational Geometry, 1992
- Some useful data structures for the generation of unstructured gridsCommunications in Applied Numerical Methods, 1988
- On approximation behavior of the greedy triangulation for convex polygonsAlgorithmica, 1987
- A heuristic triangulation algorithmJournal of Algorithms, 1987
- An ω(√n) lower bound for the nonoptimality of the greedy triangulationInformation Processing Letters, 1987
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984
- On a Data Structure for Adaptive Finite Element Mesh RefinementsACM Transactions on Mathematical Software, 1980
- A note on Delaunay and optimal triangulationsInformation Processing Letters, 1980
- Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulationInformation Processing Letters, 1979
- Locally equiangular triangulationsThe Computer Journal, 1978