Edge insertion for optimal triangulations
From MaRDI portal
Publication:2368129
DOI10.1007/BF02573962zbMath0780.68108WikidataQ56455669 ScholiaQ56455669MaRDI QIDQ2368129
Publication date: 20 September 1993
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131259
Related Items
Solving the minimum convex partition of point sets with integer programming, A linear time algorithm for max-min length triangulation of a convex polygon, OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS, Generating realistic terrains with higher-order Delaunay triangulations, Algorithms for optimal area triangulations of a convex polygon, Tiling space and slabs with acute tetrahedra., Optimal Triangulation with Steiner Points, Flips in planar graphs, One strike against the min-max degree triangulation problem, Optimization for first order Delaunay triangulations, Constrained higher order Delaunay triangulations, On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation, Optimal Higher Order Delaunay Triangulations of Polygons, Optimal higher order Delaunay triangulations of polygons, LMT-skeleton heuristics for several new classes of optimal triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal roughness property of the Delaunay triangulation
- A sweepline algorithm for Voronoi diagrams
- Voronoi diagrams from convex hulls
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Data Dependent Triangulations for Piecewise Linear Interpolation
- On Optimal Interpolation Triangle Incidences
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Minimal Triangulations of Polygonal Domains
- An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
