Optimization for first order Delaunay triangulations

DOI10.1016/j.comgeo.2009.01.010zbMath1186.65025OpenAlexW1998766404MaRDI QIDQ2269140

Maarten Löffler, Rodrigo I. Silveira, Marc J. 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

optimizationalgorithmsquality measuresgraphical examplesmaximum vertex degreehigher order Delaunay triangulationnumber of convex edgesnumber of mixed vertices

Mathematics Subject Classification ID

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

Related Items

Thread-parallel mesh improvement using face and edge swapping and vertex insertion, On crossing numbers of geometric proximity graphs, Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs, On the number of higher order Delaunay triangulations

Cites Work

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