Pages that link to "Item:Q1135110"
From MaRDI portal
The following pages link to Voronoi diagrams from convex hulls (Q1135110):
Displaying 50 items.
- About \(f\)-vectors of inscribed simplicial polytopes (Q282733) (← links)
- A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
- Perturbations for Delaunay and weighted Delaunay 3D triangulations (Q617544) (← links)
- Efficient mesh optimization schemes based on optimal Delaunay triangulations (Q646311) (← links)
- A parallel algorithm based on convexity for the computing of Delaunay tessellation (Q664607) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization (Q694527) (← links)
- Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
- On the construction of abstract Voronoi diagrams (Q757052) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- Linearly interpolated FDH efficiency score for nonconvex frontiers (Q853945) (← links)
- Universality theorems for inscribed polytopes and Delaunay triangulations (Q894687) (← links)
- A straightforward iterative algorithm for the planar Voronoi diagram (Q910230) (← links)
- Realizability of Delaunay triangulations (Q911323) (← links)
- Voronoi diagrams and arrangements (Q1079823) (← links)
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments (Q1098294) (← links)
- Primitives for the manipulation of three-dimensional subdivisions (Q1115576) (← links)
- Parallel computational geometry (Q1115600) (← links)
- An upper bound on the shortness exponent of inscribable polytopes (Q1122592) (← 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)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- An interface-fitted mesh generator and virtual element methods for elliptic interface problems (Q1685258) (← links)
- Meissner polyhedra (Q1701426) (← links)
- Neighborly inscribed polytopes and Delaunay triangulations (Q1707359) (← links)
- Fuzzy clustering using the convex hull as geometrical model (Q1750199) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- Voronoi diagrams with barriers and on polyhedra for minimal path planning (Q1822055) (← links)
- Parallel geometric algorithms on a mesh-connected computer (Q1825643) (← links)
- Voronoi diagrams on the sphere (Q1862122) (← links)
- Abstract Voronoi diagram in 3-space (Q1878678) (← 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)
- Many projectively unique polytopes (Q2017450) (← links)
- On polyhedral realization with isosceles triangles (Q2042206) (← links)
- Efficient representation of Laguerre mosaics with an application to microstructure simulation of complex ore (Q2198932) (← links)
- Fast segment insertion and incremental construction of constrained Delaunay triangulations (Q2354921) (← 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)
