Cites work
- A New Convex Hull Algorithm for Planar Sets
- An Algorithm for Convex Polytopes
- An efficient algorithm for determining the convex hull of a finite planar set
- Convex hulls of finite sets of points in two and three dimensions
- Divide and conquer for linear expected time
- Finding the intersection of n half-spaces in time O(n log n)
- scientific article; zbMATH DE number 3648730 (Why is no real title available?)
- scientific article; zbMATH DE number 3557226 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- Location of a Point in a Planar Subdivision and Its Applications
- Parallel concepts in graph theory
- Printer graphics for clustering
- Voronoui Diagrams in L₁ (L_\infty ) Metrics with 2-Dimensional Storage Applications
Cited in
(70)- Voronoi diagrams and arrangements
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- Primitives for the manipulation of three-dimensional subdivisions
- Parallel computational geometry
- An upper bound on the shortness exponent of inscribable polytopes
- An axiomatic approach to Voronoi-diagrams in 3D
- The farthest point Delaunay triangulation minimizes angles
- The \(\gamma\)-neighborhood graph
- An optimal convex hull algorithm in any fixed dimension
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Graph-theoretical conditions for inscribability and Delaunay realizability
- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space
- Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- An interface-fitted mesh generator and virtual element methods for elliptic interface problems
- Meissner polyhedra
- Neighborly inscribed polytopes and Delaunay triangulations
- Fuzzy clustering using the convex hull as geometrical model
- New applications of random sampling in computational geometry
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- Parallel geometric algorithms on a mesh-connected computer
- Voronoi diagrams on the sphere
- Abstract Voronoi diagram in 3-space
- Average case analysis of dynamic geometric optimization
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
- On Delaunay oriented matroids for convex distance functions
- Three-dimensional convex hull as a fruitful source of diagrams
- Many projectively unique polytopes
- On polyhedral realization with isosceles triangles
- Efficient representation of Laguerre mosaics with an application to microstructure simulation of complex ore
- Fast segment insertion and incremental construction of constrained Delaunay triangulations
- ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
- Edge insertion for optimal triangulations
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- Exact computation of the topology and geometric invariants of the Voronoi diagram of spheres in 3D
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- A comparison of sequential Delaunay triangulation algorithms.
- On the two-dimensional Davenport-Schinzel problem
- About \(f\)-vectors of inscribed simplicial polytopes
- scientific article; zbMATH DE number 7499212 (Why is no real title available?)
- The natural element method in solid mechanics
- A faster circle-sweep Delaunay triangulation algorithm
- Voronoi Diagrams of Moving Points
- A simple method for resolving degeneracies in Delaunay triangulations
- FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
- “The big sweep”: On the power of the wavefront approach to Voronoi diagrams
- A new duality result concerning Voronoi diagrams
- Statistical Approaches for Non‐parametric Frontier Models: A Guided Tour
- COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- Perturbations for Delaunay and weighted Delaunay 3D triangulations
- Voronoi diagrams in the moscow metric
- Efficient mesh optimization schemes based on optimal Delaunay triangulations
- On Bernoulli's method
- Boundary layer mesh generation on arbitrary geometries
- An interface-preserving moving mesh in multiple space dimensions
- A parallel algorithm based on convexity for the computing of Delaunay tessellation
- Randomized incremental construction of abstract Voronoi diagrams
- Algorithms for weak and wide separation of sets
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization
- A sparse Delaunay filtration
- Measure of circularity for parts of digital boundaries and its fast computation
- On the construction of abstract Voronoi diagrams
- Toughness and Delaunay triangulations
- On levels in arrangements and Voronoi diagrams
- Linearly interpolated FDH efficiency score for nonconvex frontiers
- Universality theorems for inscribed polytopes and Delaunay triangulations
- A straightforward iterative algorithm for the planar Voronoi diagram
- Realizability of Delaunay triangulations
This page was built for publication: Voronoi diagrams from convex hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1135110)
