Pages that link to "Item:Q287080"
From MaRDI portal
The following pages link to An optimal algorithm for realizing a Delaunay triangulation (Q287080):
Displaying 20 items.
- Witness (Delaunay) graphs (Q551502) (← links)
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions (Q673501) (← links)
- Computing optimal triangulations using simulated annealing (Q687467) (← links)
- The Voronoi functional is maximized by the Delaunay triangulation in the plane (Q722309) (← links)
- Realizability of Delaunay triangulations (Q911323) (← links)
- Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
- Approximating constrained tetrahedrizations (Q1208496) (← links)
- Simpler proof of a realizability theorem on Delaunay triangulations (Q1327308) (← links)
- Exact computation of Delaunay and power triangulations (Q1971095) (← links)
- Optimization for first order Delaunay triangulations (Q2269140) (← links)
- A simple algorithm for higher-order Delaunay mosaics and alpha shapes (Q2700389) (← links)
- An algorithm for dynamic Delaunay triangulation of simple polygon (Q2887614) (← links)
- Outerplanar Graphs and Delaunay Triangulations (Q2891323) (← links)
- Star-Unfolding Polygons (Q3452273) (← links)
- Optimization for First Order Delaunay Triangulations (Q3603525) (← links)
- (Q4037406) (← links)
- A generalized Delaunay triangulation algorithm with adaptive grid size control (Q4381961) (← links)
- Solutions to the Minimum Variance Problem Using Delaunay Triangulation (Q5139666) (← links)
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION (Q5300011) (← links)
- A time-optimal delaunay refinement algorithm in two dimensions (Q5370616) (← links)