Towards a definition of higher order constrained Delaunay triangulations

DOI10.1016/j.comgeo.2008.09.005zbMath1159.65024OpenAlexW2163863665MaRDI QIDQ1005329

Rodrigo I. Silveira, Marc J. van Kreveld

Publication date: 9 March 2009

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsconstrained Delaunay triangulationhigher order Delaunay triangulations

Mathematics Subject Classification ID

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

Related Items

Optimal higher order Delaunay triangulations of polygons

Cites Work

• Unnamed Item
• Generating realistic terrains with higher-order Delaunay triangulations
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Constrained Delaunay triangulations
• Triangulating a simple polygon in linear time
• Higher order Delaunay triangulations
• Constrained higher order Delaunay triangulations
• Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay
• Data Dependent Triangulations for Piecewise Linear Interpolation
• Optimization for First Order Delaunay Triangulations
• A linear algorithm for computing the visibility polygon from a point
• Optimal Higher Order Delaunay Triangulations of Polygons
• SOFSEM 2006: Theory and Practice of Computer Science