3-D Voronoi tessellation algorithms
From MaRDI portal
Publication:2388259
DOI10.1007/BF03167439zbMath1104.68120MaRDI QIDQ2388259
Publication date: 12 September 2005
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Uses Software
Cites Work
- Unnamed Item
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
- An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD
- Fast computation of the Euclidean distance maps for binary images
- A fast algorithm for Euclidean distance maps of a 2-D binary image
- A unified linear-time algorithm for computing distance maps
- Fast raster scan distance propagation on the discrete rectangular lattice