GPU-based efficient computation of power diagram

Abstract Power diagrams are widely used in graphics and engineering. One of the most complex operations defined on the centroidal capacity-constrained power diagrams is the geometrical construction, which takes more than 50% of the total computing time. In order to overcome this performance bottleneck, we propose a novel GPU-based power diagram construction algorithm. To this end, we first introduce the jump flooding algorithm for parallel rendering of the power diagram, and present an approach for extracting the geometrical vertices and edges. Next, we introduce two novel GPU-based algorithms to improve the computational performance. The first algorithm allows a hybrid GPU-CPU implementation by coupling the existing CPU-based algorithm while the second algorithm is a pure GPU implementation for the platforms where GPU hardware is capable of significant speedups. In our implementation, we utilize the discrete Lloyd’s algorithm for centroidal constraints and a GPU-based analytical algorithm for weights and capacities. Experiment results show that our approach improves the effciency of the power diagram construction up to several orders of magnitude.

[1]  Mathieu Desbrun,et al.  HOT: Hodge-optimized triangulations , 2011, SIGGRAPH 2011.

[2]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[3]  Eftychios Sifakis,et al.  Power diagrams and sparse paged grids for high resolution adaptive liquids , 2017, ACM Trans. Graph..

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

[5]  D. P. Bourne,et al.  Centroidal Power Diagrams, Lloyd's Algorithm, and Applications to Optimal Location Problems , 2014, SIAM J. Numer. Anal..

[6]  Shi-Qing Xin,et al.  Centroidal power diagrams with capacity constraints , 2016, ACM Trans. Graph..

[7]  M. Balzer,et al.  Capacity-Constrained Voronoi Diagrams in Finite Spaces , 2008 .

[8]  Michael Balzer,et al.  Capacity-Constrained Voronoi Diagrams in Continuous Spaces , 2009, 2009 Sixth International Symposium on Voronoi Diagrams.

[9]  Hiroshi Imai,et al.  Voronoi Diagram in the Laguerre Geometry and its Applications , 1985, SIAM J. Comput..

[10]  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).

[11]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[12]  Cheng Wang,et al.  Optimal power diagrams via function approximation , 2018, Comput. Aided Des..

[13]  Jianwei Guo,et al.  A Simple Push-Pull Algorithm for Blue-Noise Sampling , 2017, IEEE Transactions on Visualization and Computer Graphics.

[14]  Michael Balzer,et al.  Voronoi treemaps for the visualization of software metrics , 2005, SoftVis '05.

[15]  Mathieu Desbrun,et al.  Blue noise through optimal transport , 2012, ACM Trans. Graph..

[16]  Sen Zhang,et al.  Capacity constrained blue-noise sampling on surfaces , 2016, Comput. Graph..

[17]  Zheng Li,et al.  Study on the Method of Sector Division Based on the Power Diagram , 2009, 2009 International Conference on Measuring Technology and Mechatronics Automation.

[18]  Yiying Tong,et al.  Power coordinates , 2016, ACM Trans. Graph..

[19]  Mathieu Desbrun,et al.  Power particles , 2015, ACM Trans. Graph..

[20]  O. Deussen,et al.  Capacity-constrained point distributions: a variant of Lloyd's method , 2009, SIGGRAPH 2009.