Approximating the minimum weight Steiner triangulation

DOI10.1007/BF02574002zbMath0797.68154MaRDI QIDQ1317876

David Eppstein

Publication date: 19 October 1994

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131296

zbMATH Keywords

computational geometryminimum weight Steiner triangulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

A fast heuristic for approximating the minimum weight triangulation, Unnamed Item, A polytree based coupling method for non-matching meshes in 3D, Steiner reducing sets of minimum weight triangulations: Structure and topology, Preprocessing imprecise points for Delaunay triangulation: simplified and extended, Minimum weight convex Steiner partitions, PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS, Polygon decomposition for efficient construction of Minkowski sums, An asynchronous parallel explicit solver based on scaled boundary finite element method using octree meshes, Quadtree, ray shooting and approximate minimum weight Steiner triangulation

Cites Work

• On approximation behavior of the greedy triangulation for convex polygons
• A note on Delaunay and optimal triangulations
• The farthest point Delaunay triangulation minimizes angles
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• On Optimal Interpolation Triangle Incidences
• A heuristic triangulation algorithm
• Some useful data structures for the generation of unstructured grids
• On a Data Structure for Adaptive Finite Element Mesh Refinements
• Minimal Triangulations of Polygonal Domains
• Fast algorithms for greedy triangulation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item