Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the sixteenth annual symposium on Computational geometry
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Linear algebra operators for GPU implementation of numerical algorithms
ACM SIGGRAPH 2003 Papers
How fast is the k-means method?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Jump flooding in GPU with applications to Voronoi diagram and distance transform
I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Journal of Mathematical Imaging and Vision
ACM SIGGRAPH 2006 Research posters
Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams
ISVD '07 Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering
Data-parallel algorithms and data structures
ACM SIGGRAPH 2007 courses
Computing two-dimensional Delaunay triangulation using graphics hardware
Proceedings of the 2008 symposium on Interactive 3D graphics and games
Hyperbolic centroidal Voronoi tessellation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
ACIVS'11 Proceedings of the 13th international conference on Advanced concepts for intelligent vision systems
Centroidal Voronoi tessellation in universal covering space of manifold surfaces
Computer Aided Geometric Design
Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent
Computer Graphics Forum
| Hi-index | 0.00 |
The Centroidal Voronoi Diagram (CVD) is a very versatile structure, well studied in Computational Geometry. It is used as the basis for a number of applications. This paper presents a deterministic algorithm, entirely computed using graphics hardware resources, based on Lloyd's Method for computing CVDs. While the computation of the ordinary Voronoi diagram on GPU is a well explored topic, its extension to CVDs presents some challenges that the present study intends to overcome.