Edge insertion for optimal triangulations

DOI10.1007/BF02573962zbMATH Open0780.68108WikidataQ56455669 ScholiaQ56455669MaRDI QIDQ2368129FDOQ2368129

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

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

zbMATH Keywords

triangulationsedge-insertion

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A sweepline algorithm for Voronoi diagrams
• Voronoi diagrams from convex hulls
• Randomized incremental construction of Delaunay and Voronoi diagrams
• On Optimal Interpolation Triangle Incidences
• Title not available (Why is that?)
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Title not available (Why is that?)
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Data Dependent Triangulations for Piecewise Linear Interpolation
• Minimal roughness property of the Delaunay triangulation
• Minimal Triangulations of Polygonal Domains
• Title not available (Why is that?)

Cited In (25)

• Solving the minimum convex partition of point sets with integer programming
• 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
• Title not available (Why is that?)
• 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
• Computing MaxMin edge length triangulations
• Flips in planar graphs
• Title not available (Why is that?)

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)