A fast robust algorithm for computing discrete Voronoi diagrams
From MaRDI portal
Publication:846176
DOI10.1007/s10852-008-9097-6zbMath1186.68516OpenAlexW2045729041WikidataQ57858952 ScholiaQ57858952MaRDI QIDQ846176
Mirko Velić, Louis Moresi, Dave A. May
Publication date: 1 February 2010
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-008-9097-6
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
- Fast algorithms for approximating distances
- Rapid and accurate computation of the distance function using grids
- A Lagrangian integration point finite element method for large deformation modeling of viscoelastic geomaterials.
- Voronoi-like partition of lattice in cellular automata
- A hybrid cellular automaton/neural network classifier for multi-valued patterns and its VLSI implementation
- Approximating Voronoi Diagrams of Convex Sites in Any Dimension