A fast and robust seed flooding algorithm on GPU for Voronoi diagram generation

Voronoi diagram(VD) is a fundamental data structure in computational geometry. With the rapid development of programmable graphics programmable units, utilizing GPU to construct VD has been an optimal strategy. Considering the bridles of state-of-art algorithms, a seed flooding algorithm(SFA) is presented to achieve both robustness and high performance. The experimental results shows that SFA can construct exact discrete Voronoi diagrams with comparable performance of jump flooding algorithm(JFA), which is considered as the fastest approximate algorithm on GPU. The limitations of this algorithm are also analyzed and the schemes to alleviate the negative effect brought by bad inputs is presented.

[1]  Markus Oswald Denny,et al.  Algorithmic geometry via graphics hardware , 2003 .

[2]  Tiow Seng Tan,et al.  Jump flooding in GPU with applications to Voronoi diagram and distance transform , 2006, I3D '06.

[3]  Wenping Wang,et al.  GPU-Assisted Computation of Centroidal Voronoi Tessellation , 2011, IEEE Transactions on Visualization and Computer Graphics.

[4]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[5]  Joseph S. Szakas,et al.  Parallel algorithms to find the Voronoi diagram and the order-k Voronoi diagram , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[6]  Christian Trefftz,et al.  Computation of Voronoi diagrams using a graphics processing unit , 2008, 2008 IEEE International Conference on Electro/Information Technology.

[7]  Leonidas J. Guibas,et al.  Robust Voronoi-based curvature and feature estimation , 2009, Symposium on Solid and Physical Modeling.

[8]  Tiow Seng Tan,et al.  Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams , 2007, 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007).

[9]  Chenglei Yang,et al.  On centroidal voronoi tessellation—energy smoothness and fast computation , 2009, TOGS.

[10]  Markus Denny,et al.  Solving Geometric Optimization Problems using Graphics Hardware , 2003, Comput. Graph. Forum.

[11]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..

[12]  Marcelo Gattass,et al.  Lloyd's Algorithm on GPU , 2008, ISVC.