A new parallel algorithm for constructing Voronoi tessellations from distributed input data
From MaRDI portal
Publication:525736
DOI10.1016/j.cpc.2014.08.020zbMath1360.65076OpenAlexW2007281806WikidataQ124613075 ScholiaQ124613075MaRDI QIDQ525736
David P. Starinshak, J. Michael Owen, James N. Johnson
Publication date: 5 May 2017
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2014.08.020
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05)
Related Items (5)
An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ CRKSPH - A conservative reproducing kernel smoothed particle hydrodynamics scheme ⋮ Adaptive reconnection-based arbitrary Lagrangian Eulerian method ⋮ A consistent parallel isotropic unstructured mesh generation method based on multi-phase SPH
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Reale: a Reconnection-based Arbitrary-Lagrangian-Eulerian method
- A sweepline algorithm for Voronoi diagrams
- Design and implementation of a practical parallel Delaunay algorithm
- A nearly optimal deterministic parallel Voronoi diagram algorithm
- Point-centered domain decomposition for parallel molecular dynamics simulation
- On Mesh Geometry and Stiffness Matrix Conditioning for General Finite Element Spaces
- Parallel Delaunay mesh generation kernel
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Least squares quantization in PCM
This page was built for publication: A new parallel algorithm for constructing Voronoi tessellations from distributed input data