Edge insertion for optimal triangulations

DOI10.1007/BF02573962MaRDI QIDQ2368129zbMATH OpenWikidataFDO

Authors Yanyan Li

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

zbMATH Keywords

triangulationsedge-insertion

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• An algorithm for constructing locally optimal min-max triangulation
• LMT-skeleton heuristics for several new classes of optimal triangulations
• scientific article; zbMATH DE number 1985293

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 4028826 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3633695 (Why is no real title available?)
• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• scientific article; zbMATH DE number 3438337 (Why is no real title available?)
• A sweepline algorithm for Voronoi diagrams
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• Data Dependent Triangulations for Piecewise Linear Interpolation
• Minimal Triangulations of Polygonal Domains
• Minimal roughness property of the Delaunay triangulation
• On Optimal Interpolation Triangle Incidences
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Voronoi diagrams from convex hulls

Cited in

(25)

• Solving the minimum convex partition of point sets with integer programming
• scientific article; zbMATH DE number 1163631 (Why is no real title available?)
• One strike against the min-max degree triangulation problem
• Dilation-Optimal Edge Deletion in Polygonal Cycles
• Optimal Triangulation with Steiner Points
• Edge Proximity Conditions for Extendability in Planar Triangulations
• On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation
• scientific article; zbMATH DE number 1985293 (Why is no real title available?)
• Computing MaxMin edge length triangulations
• Generating realistic terrains with higher-order Delaunay triangulations
• LMT-skeleton heuristics for several new classes of optimal triangulations
• On Optimal Interpolation Triangle Incidences
• Tiling space and slabs with acute tetrahedra.
• Constrained higher order Delaunay triangulations
• Algorithms for optimal area triangulations of a convex polygon
• Optimization for first order Delaunay triangulations
• A linear time algorithm for max-min length triangulation of a convex polygon
• The neutral case for the min-max triangulation
• Computational Science and Its Applications – ICCSA 2004
• OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
• Optimal Higher Order Delaunay Triangulations of Polygons
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• Optimal higher order Delaunay triangulations of polygons
• Flips in planar graphs
• Computing MaxMin edge length triangulations

This page was built for publication: Edge insertion for optimal triangulations

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