Voronoi diagrams and Delaunay triangulations
clusteringcomputational complexityalgorithmDelaunay triangulationVoronoi diagrampath planningmedial axisminimal spanning treepower diagramconvex distancezone diagramalpha-shapebeta-skeletonleast square matching
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Combinatorial aspects of tessellation and tiling problems (05B45) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Combinatorial complexity of geometric structures (52C45) Continuous location (90B85)
- Stretch factor in a planar Poisson-Delaunay triangulation with a large intensity
- Complex systems: features, similarity and connectivity
- Sensitivity analysis and tailored design of minimization diagrams
- Tropical bisectors and Voronoi diagrams
- Price competition with differentiated products on a two-dimensional plane: the impact of partial cartel on firms' profits and behavior
- On 2-site Voronoi diagrams under geometric distance functions
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
- The higher-order Voronoi diagram of line segments
- Power Diagrams: Properties, Algorithms and Applications
- Near optimal minimal convex hulls of disks
- Algorithms and Computation
- Discontinuous Galerkin method with Voronoi partitioning for quantum simulation of chemistry
- QuickhullDisk: a faster convex hull algorithm for disks
- Data-driven selection of tessellation models describing polycrystalline microstructures
- A note on visibility-constrained Voronoi diagrams
- On the complexity of higher order abstract Voronoi diagrams
- Distributed partitioning algorithms for multi-agent networks with quadratic proximity metrics and sensing constraints
- Hamiltonicity for convex shape Delaunay and Gabriel graphs
- On Bregman Voronoi diagrams
- On the Triangle-Perimeter Two-Site Voronoi Diagram
- Assessment of implicit adaptive mesh-free CFD modelling
- Bregman Voronoi diagrams
- An invitation to tropical Alexandrov curvature
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- The obnoxious competitive facility location model
- scientific article; zbMATH DE number 7204982 (Why is no real title available?)
- The state of the art of Voronoi diagram research
- A multicellular model of intestinal crypt buckling and fission
- Heterogeneous domain decomposition method for high contrast dense composites
- The maximal degree in a Poisson-Delaunay graph
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- Voronoi diagrams and arrangements
- Abstract Voronoi diagrams from closed bisecting curves
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- The mixed center location problem
- Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location
- On the restricted 1-Steiner tree problem
- The obnoxious facilities planar \(p\)-median problem
- Optimal recovery of integral operators and its applications
- Hierarchical Voronoi diagrams for spatial data indexing and paging
- Macroscopic damping model for structural dynamics with random polycrystalline configurations
- Cluster size distributions of extreme values for the Poisson-Voronoi tessellation
- Union of hypercubes and 3D Minkowski sums with random sizes
- Voronoi polygons and polyhedra
- Mitered offsets and skeletons for circular arc polygons
- Union of hypercubes and 3D Minkowski sums with random sizes
- The \(\beta\)-Delaunay tessellation. III: Kendall's problem and limit theorems in high dimensions
- scientific article; zbMATH DE number 7651184 (Why is no real title available?)
- Voronoi diagram for convex polygonal sites with convex polygon-offset distance function
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Stabbing circles for sets of segments in the plane
- Voronoi Diagrams for Parallel Halflines and Line Segments in Space
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Stable-matching Voronoi diagrams: combinatorial complexity and algorithms
- Deletion in abstract Voronoi diagrams in expected linear time and related problems
- On groups \(G_n^k\) and \(\Gamma_n^k\): a study of manifolds, dynamics, and invariants
- Review of obnoxious facilities location problems
- Nearest-neighbor searching under uncertainty. I
- A spatial extension of weather forecasts
- Elastic-plastic deformation decomposition algorithm for metal clusters at the atomic scale
- On triangulation axes of polygons
- Spatial context. An introduction to fundamental computer algorithms for spatial analysis
- Geometric relations among Voronoi diagrams
- Perturbing isoradial triangulations
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations
- The Mixed Center Location Problem
- Non-simplicial Delaunay meshing via approximation by radical partitions
- Parallel computation of alpha complexes for biomolecules
- A random walk approach to transport in tissues and complex media: from microscale descriptions to macroscale models
- scientific article; zbMATH DE number 5815936 (Why is no real title available?)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- scientific article; zbMATH DE number 1754563 (Why is no real title available?)
- Competitive online routing on Delaunay triangulations
- scientific article; zbMATH DE number 1520171 (Why is no real title available?)
- Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems
- On clustering induced Voronoi diagrams
- From proximity to utility: a Voronoi partition of Pareto optima
- Straight skeletons and mitered offsets of nonconvex polytopes
- Ideal hyperbolic polyhedra and discrete uniformization
- Some Voronoi diagrams that consider consumer behavior analysis
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
- Stable Delaunay graphs
- scientific article; zbMATH DE number 1390217 (Why is no real title available?)
- Voronoi diagrams and Delaunay triangulations: ubiquitous siamese twins
- A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools
- Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
- Orphan-free anisotropic Voronoi diagrams
- Persistent homology in \(\ell_\infty\) metric
- Affine invariant triangulations
- Curved Voronoi diagrams
- Fitting spherical Laguerre Voronoi diagrams to real-world tessellations using planar photographic images
- Empirical Voronoi wavelets
- Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams
- The -Delaunay tessellation: Description of the model and geometry of typical cells
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- Separation by convex pseudo-circles
- Midsets and Voronoi type decomposition with respect to closed convex sets
- On Voronoi diagrams and medial axes
This page was built for publication: Voronoi diagrams and Delaunay triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854053)