A fast robust algorithm for computing discrete Voronoi diagrams
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5815936
- An algorithm for \(L_p\)-Voronoi diagram construction on discrete grid in 2D
- A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
- Stable marker-particle method for the Voronoi diagram in a flow field
- An iterative algorithm for computing measures of generalized Voronoi regions
Cites work
- scientific article; zbMATH DE number 4033243 (Why is no real title available?)
- scientific article; zbMATH DE number 1079755 (Why is no real title available?)
- A Lagrangian integration point finite element method for large deformation modeling of viscoelastic geomaterials.
- A hybrid cellular automaton/neural network classifier for multi-valued patterns and its VLSI implementation
- Approximating Voronoi Diagrams of Convex Sites in Any Dimension
- Fast algorithms for approximating distances
- Rapid and accurate computation of the distance function using grids
- Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
- Voronoi-like partition of lattice in cellular automata
Cited in
(11)- scientific article; zbMATH DE number 3889235 (Why is no real title available?)
- A rapid approximate algorithm for computing the areas/volumes of the cells in weakly inhomogeneous Voronoi diagram
- Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
- A new parallel algorithm for constructing Voronoi tessellations from distributed input data
- Fast raster scan distance propagation on the discrete rectangular lattice
- An algorithm for \(L_p\)-Voronoi diagram construction on discrete grid in 2D
- Robust Point-Location in Generalized Voronoi Diagrams
- Fast and accurate Voronoi density gridding from Lagrangian hydrodynamics data
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
This page was built for publication: A fast robust algorithm for computing discrete Voronoi diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846176)