Optimal Triangulation with Steiner Points
From MaRDI portal
Recommendations
Cites work
- A subexponential bound for linear programming
- Almost tight upper bounds for vertical decompositions in four dimensions
- Delaunay refinement algorithms for triangular mesh generation
- Edge insertion for optimal triangulations
- Generalized Delaunay triangulation for planar graphs
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- Laplacian smoothing and Delaunay triangulations
- Triangulating a simple polygon in linear time
Cited in
(9)- The neutral case for the min-max angle criterion: A generalized concept
- Approximating uniform triangular meshes in polygons.
- scientific article; zbMATH DE number 6712763 (Why is no real title available?)
- Quality Triangulations with Locally Optimal Steiner Points
- ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
- Regular triangulations and Steiner points
- Cutting corners cheaply, or how to remove Steiner points
- Cutting Corners Cheaply, or How to Remove Steiner Points
This page was built for publication: Optimal Triangulation with Steiner Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387801)