Pages that link to "Item:Q1849762"
From MaRDI portal
The following pages link to Splitting a Delaunay triangulation in linear time (Q1849762):
Displaying 9 items.
- A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations (Q471140) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance (Q1710303) (← links)
- Spanning trees in multipartite geometric graphs (Q1755734) (← links)
- The greedy triangulation can be computed from the Delaunay triangulation in linear time (Q1969592) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)