Approximating the minimum weight Steiner triangulation

DOI10.1007/BF02574002MaRDI QIDQ1317876zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 742947
• Quadtree, ray shooting and approximate minimum weight Steiner triangulation
• scientific article; zbMATH DE number 1305409
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
• New results for the minimum weight triangulation problem

Cites work

• scientific article; zbMATH DE number 432801 (Why is no real title available?)
• scientific article; zbMATH DE number 3841230 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 742947 (Why is no real title available?)
• A heuristic triangulation algorithm
• A note on Delaunay and optimal triangulations
• Fast algorithms for greedy triangulation
• Minimal Triangulations of Polygonal Domains
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• On Optimal Interpolation Triangle Incidences
• On a Data Structure for Adaptive Finite Element Mesh Refinements
• On approximation behavior of the greedy triangulation for convex polygons
• Some useful data structures for the generation of unstructured grids
• The farthest point Delaunay triangulation minimizes angles

Cited in

(13)

• PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
• An asynchronous parallel explicit solver based on scaled boundary finite element method using octree meshes
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Minimum diameter vertex-weighted Steiner tree
• Quadtree, ray shooting and approximate minimum weight Steiner triangulation
• Steiner reducing sets of minimum weight triangulations: Structure and topology
• Minimum weight convex Steiner partitions
• Polygon decomposition for efficient construction of Minkowski sums
• scientific article; zbMATH DE number 871937 (Why is no real title available?)
• A polytree based coupling method for non-matching meshes in 3D
• Method for finding and storing optimal triangulations based on square matrix
• scientific article; zbMATH DE number 742947 (Why is no real title available?)
• A fast heuristic for approximating the minimum weight triangulation

This page was built for publication: Approximating the minimum weight Steiner triangulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317876)