Optimization for first order Delaunay triangulations

DOI10.1016/J.COMGEO.2009.01.010MaRDI QIDQ2269140zbMATH OpenOpenAlexFDO

Authors Maarten Löffler, Rodrigo I. Silveira, Marc Van Kreveld

Publication date 16 March 2010

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2009.01.010

zbMATH Keywords

algorithmsgraphical exampleshigher order Delaunay triangulationmaximum vertex degreenumber of convex edgesnumber of mixed verticesoptimizationquality measures

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Optimization for First Order Delaunay Triangulations
• scientific article; zbMATH DE number 2066953
• Optimal higher order Delaunay triangulations of polygons
• Optimal Higher Order Delaunay Triangulations of Polygons
• An optimal algorithm for realizing a Delaunay triangulation
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• On the optimality of functionals over triangulations of Delaunay sets
• scientific article; zbMATH DE number 1670662

Cites work

• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A partial k-arboretum of graphs with bounded treewidth
• A Quadratic Time Algorithm for the Minmax Length Triangulation
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Approximation algorithms for NP-complete problems on planar graphs
• Approximation schemes for covering and packing problems in image processing and VLSI
• Edge insertion for optimal triangulations
• Generating realistic terrains with higher-order Delaunay triangulations
• Graph minors. II. Algorithmic aspects of tree-width
• Higher order Delaunay triangulations
• scientific article; zbMATH DE number 1424294 (Why is no real title available?)
• scientific article; zbMATH DE number 1424295 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Minimum weight triangulation is NP-hard
• Optimal Higher Order Delaunay Triangulations of Polygons
• Planar Formulae and Their Uses
• Triangulating planar graphs while minimizing the maximum degree

Cited in

(8)

• Optimal higher order Delaunay triangulations of polygons
• Thread-parallel mesh improvement using face and edge swapping and vertex insertion
• Modified Delaunay empty sphere condition in the problem of approximation of the gradient
• Optimization for First Order Delaunay Triangulations
• On the number of higher order Delaunay triangulations
• On crossing numbers of geometric proximity graphs
• Order-2 Delaunay triangulations optimize angles
• Some properties of k-Delaunay and k-Gabriel graphs

This page was built for publication: Optimization for first order Delaunay triangulations

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