Higher-dimensional Voronoi diagrams in linear expected time
From MaRDI portal
Publication:804320
DOI10.1007/BF02574694zbMath0727.68128OpenAlexW2097944783WikidataQ56047088 ScholiaQ56047088MaRDI QIDQ804320
Publication date: 1991
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131163
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes, A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis, PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS, GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING, Incremental topological flipping works for regular triangulations, A boundary-partition-based Voronoi diagram of \(d\)-dimensional balls: definition, properties, and applications, The impact of heterogeneity and geometry on the proof complexity of random satisfiability, The Morse theory of Čech and Delaunay complexes, The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs, A faster circle-sweep Delaunay triangulation algorithm, A simple algorithm for higher-order Delaunay mosaics and alpha shapes, A space-time adaptive method for reservoir flows: formulation and one-dimensional application, A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE, Complexity of the Delaunay triangulation of points on polyhedral surfaces, 3/4-Discrete Optimal Transport, Voronoi diagrams of random lines and flats, Applications of random sampling to on-line algorithms in computational geometry, THE DELAUNAY HIERARCHY, A comparison of sequential Delaunay triangulation algorithms., On the randomized construction of the Delaunay tree, Node-based parallel computing of three-dimensional incompressible flows using the free mesh method, Unnamed Item, Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints, Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints, Randomized incremental construction of Delaunay triangulations of nice point sets, Unnamed Item, Persistent homology in \(\ell_\infty\) metric, Moment preserving constrained resampling with applications to particle-in-cell methods, A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case, Fast multivariate log-concave density estimation, The expected number of \(k\)-faces of a Voronoi diagram, Convergence of Anisotropic Mesh Adaptation via Metric Optimization, On Some Proximity Problems of Colored Sets, A Robust Implementation for Three-Dimensional Delaunay Triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for three-dimensional Voronoi tessellation
- Delaunay triangulation and the convex hull of n points in expected linear time
- Voronoi diagrams and arrangements
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- Random spheres in a convex body
- Construction of Voronoi polyhedra
- A procedure for the construction of Voronoi polyhedra
- Finding the convex hull facet by facet
- On the convex hull of random points in a polytope
- Optimal Expected-Time Algorithms for Closest Point Problems
- [https://portal.mardi4nfdi.de/wiki/Publication:5331598 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II]
- The convex hull of a random set of points
- Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. I
- An Algorithm for Convex Polytopes
- Isotropic random simplices
- Random Subdivisions of Space into Crystals
- [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]
