Improved Initialisation for Centroidal Voronoi Tessellation and Optimal Delaunay Triangulation


J.A. Quinn, F. Sun, F. C. Langbein, Y.-K. Lai, W. Wang, R. R. Martin. Improved Initialisation for Centroidal Voronoi Tessellation and Optimal Delaunay Triangulation. Computer Aided Design, 44(11):1062-1071, 2012. [DOI:10.1016/j.cad.2012.05.002] [PDF]

Centroidal Voronoi tessellations and optimal Delaunay triangulations can be approximated efficiently by non-linear optimisation algorithms. This paper demonstrates that the point distribution used to initialise the optimisation algorithms is important. Compared to conventional random initialisation, certain low-discrepancy point distributions help convergence towards more spatially regular results and require fewer iterations for planar and volumetric tessellations.

butterfly

butterfly

Cite this page as 'Frank C Langbein, "Improved Initialisation for Centroidal Voronoi Tessellation and Optimal Delaunay Triangulation," Ex Tenebris Scientia, 4th November 2012, https://langbein.org/quinn2012/ [accessed 16th June 2019]'.

CC BY-NC-SA 4.0 This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.