Pages that link to "Item:Q1135110"
From MaRDI portal
The following pages link to Voronoi diagrams from convex hulls (Q1135110):
Displayed 19 items.
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- An axiomatic approach to Voronoi-diagrams in 3D (Q1176108) (← links)
- The farthest point Delaunay triangulation minimizes angles (Q1188284) (← links)
- The \(\gamma\)-neighborhood graph (Q1194312) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\) (Q1334932) (← links)
- Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space (Q1370927) (← links)
- Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation (Q1371879) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- On Delaunay oriented matroids for convex distance functions (Q1923774) (← links)
- Three-dimensional convex hull as a fruitful source of diagrams (Q1978717) (← links)
- ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram (Q2367127) (← links)
- Edge insertion for optimal triangulations (Q2368129) (← links)
- (Q4253886) (← links)
- Voronoi Diagrams of Moving Points (Q4513216) (← links)