A novel computation method of hybrid capacity constrained centroidal power diagram

Abstract Power diagrams, as a powerful extension of Voronoi diagrams, have been utilized in a wide range of applications in various fields. By imposing the capacity constraint and the centroid constraint to the ordinary power diagram, capacity-constrained power diagram and centroidal capacity-constrained power diagram can be obtained respectively, in which, all the capacity constraints are fixed values. However, some practical applications require a special kind of power diagrams, called hybrid capacity-constrained centroidal power diagrams, where not all capacity constraints are fixed values, and instead there are some capacities of sites constrained to intervals. To this end, we propose an iterative computation method for the power diagrams with hybrid capacity constraints. On the one hand, a weight evaluated method is introduced to update the weights of interval capacity-constrained sites, and Newton’s method is applied to optimize the weights of fixed-value capacity-constrained sites. On the other hand, Lloyd’s method is employed to move the sites to their respective mass centers. Experimental results prove that the proposed method can effectively compute the centroidal power diagram with hybrid capacity constraints.

[1]  L. Cooper Location-Allocation Problems , 1963 .

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

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

[4]  Sehoon Ha,et al.  Iterative Training of Dynamic Skills Inspired by Human Coaching Techniques , 2014, ACM Trans. Graph..

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

[6]  David A. Forsyth,et al.  Generalizing motion edits with Gaussian processes , 2009, ACM Trans. Graph..

[7]  Haibo Chen,et al.  Geometry-constrained crowd formation animation , 2014, Comput. Graph..

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

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

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

[11]  Derek Nowrouzezahrai,et al.  Learning hatching for pen-and-ink illustration of surfaces , 2012, TOGS.

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

[13]  Franz Aurenhammer,et al.  Minkowski-Type Theorems and Least-Squares Clustering , 1998, Algorithmica.

[14]  Jon G. Rokne,et al.  An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane , 1996, Int. J. Comput. Math..

[15]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

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

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

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

[19]  P. Gritzmann,et al.  Generalized balanced power diagrams for 3D representations of polycrystals , 2014, 1411.4535.

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

[21]  Zheng Li,et al.  Research on the Methods of Multi-Airport Sector Division Based on a Power Diagram , 2011 .

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

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

[24]  Mathieu Desbrun,et al.  HOT: Hodge-optimized triangulations , 2011, ACM Trans. Graph..

[25]  Gaofeng Zhang,et al.  GPU-based efficient computation of power diagram , 2019, Comput. Graph..