Optimal Triangulation with Steiner Points
From MaRDI portal
Publication:5387801
DOI10.1007/978-3-540-77120-3_59zbMath1193.68263OpenAlexW1492980284MaRDI QIDQ5387801
Stefan Funke, Tetsuo Asano, Boris Aronov
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_59
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Steiner systems in finite geometry (51E10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Delaunay triangulation for planar graphs
- Triangulating a simple polygon in linear time
- Delaunay refinement algorithms for triangular mesh generation
- A subexponential bound for linear programming
- Edge insertion for optimal triangulations
- Almost tight upper bounds for vertical decompositions in four dimensions
- Laplacian smoothing and Delaunay triangulations
