Optimal Higher Order Delaunay Triangulations of Polygons

DOI10.1007/978-3-540-78773-0_12zbMATH Open1136.68599OpenAlexW1551776875MaRDI QIDQ5458523FDOQ5458523

Authors Rodrigo I. Silveira, Marc 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) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• Optimal higher order Delaunay triangulations of polygons
• On the number of higher order Delaunay triangulations
• On the Number of Higher Order Delaunay Triangulations
• Higher order Delaunay triangulations
• Constrained higher order Delaunay triangulations

Cites Work

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

Cited In (12)

• Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
• Towards a definition of higher order constrained Delaunay triangulations
• Delaunay triangulations in O (sort( n )) time and more
• Title not available (Why is no real title available?)
• Higher order Delaunay triangulations
• On the Number of Higher Order Delaunay Triangulations
• On sorting triangles in a Delaunay tessellation
• Optimization for first order Delaunay triangulations
• Title not available (Why is no real title available?)
• Order-2 Delaunay triangulations optimize angles
• Optimization for First Order Delaunay Triangulations
• A simple algorithm for higher-order Delaunay mosaics and alpha shapes

This page was built for publication: Optimal Higher Order Delaunay Triangulations of Polygons

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