Optimal Higher Order Delaunay Triangulations of Polygons

DOI10.1007/978-3-540-78773-0_12zbMath1136.68599OpenAlexW1551776875MaRDI QIDQ5458523

Rodrigo I. Silveira, Marc J. van Kreveld

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Optimization for first order Delaunay triangulations, Towards a definition of higher order constrained Delaunay triangulations

Cites Work

• Unnamed Item
• Generating realistic terrains with higher-order Delaunay triangulations
• Constrained Delaunay triangulations
• Higher order Delaunay triangulations
• Constrained higher order Delaunay triangulations
• The greedy triangulation can be computed from the Delaunay triangulation in linear time
• Edge insertion for optimal triangulations
• Algorithms for optimal area triangulations of a convex polygon
• Delaunay-based representation of surfaces defined over arbitrarily shaped domains
• Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay
• Optimization for First Order Delaunay Triangulations
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Minimal Triangulations of Polygonal Domains
• A Quadratic Time Algorithm for the Minmax Length Triangulation
• An optimal algorithm for intersecting line segments in the plane
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• SOFSEM 2006: Theory and Practice of Computer Science