Approximating the minimum weight Steiner triangulation
From MaRDI portal
Publication:1317876
DOI10.1007/BF02574002zbMATH Open0797.68154MaRDI QIDQ1317876FDOQ1317876
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- The farthest point Delaunay triangulation minimizes angles
- On Optimal Interpolation Triangle Incidences
- Some useful data structures for the generation of unstructured grids
- Minimal Triangulations of Polygonal Domains
- A note on Delaunay and optimal triangulations
- Title not available (Why is that?)
- A heuristic triangulation algorithm
- On approximation behavior of the greedy triangulation for convex polygons
- On a Data Structure for Adaptive Finite Element Mesh Refinements
- Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
- Fast algorithms for greedy triangulation
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (13)
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation
- Minimum weight convex Steiner partitions
- Title not available (Why is that?)
- A polytree based coupling method for non-matching meshes in 3D
- Minimum diameter vertex-weighted Steiner tree
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- Steiner reducing sets of minimum weight triangulations: Structure and topology
- Polygon decomposition for efficient construction of Minkowski sums
- Title not available (Why is that?)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- A fast heuristic for approximating the minimum weight triangulation
- Title not available (Why is that?)
- An asynchronous parallel explicit solver based on scaled boundary finite element method using octree meshes
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)
