Pages that link to "Item:Q1094872"
From MaRDI portal
The following pages link to A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872):
Displayed 15 items.
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints (Q727384) (← links)
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
- Minimal roughness property of the Delaunay triangulation (Q751165) (← links)
- Higher-dimensional Voronoi diagrams in linear expected time (Q804320) (← links)
- HCPO: an efficient insertion order for incremental Delaunay triangulation (Q834986) (← links)
- A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282) (← links)
- Triangulations in CGAL (Q1602941) (← links)
- Delaunay refinement algorithms for triangular mesh generation (Q1602942) (← links)
- LOOK: A lazy object-oriented kernel design for geometric computation (Q1602944) (← links)
- The maximum opposite angulation for mesh construction (Q1774289) (← links)
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
- Reprint of: Delaunay refinement algorithms for triangular mesh generation (Q2249046) (← links)
- SAR imaging simulation for an inhomogeneous undulated lunar surface based on triangulated irregular network (Q2267086) (← links)
- A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)