Skip to Main content Skip to Navigation
Journal articles

2D Centroidal Voronoi Tessellations with Constraints

Jane Tournois 1 Pierre Alliez 1 Olivier Devillers 1 
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : We tackle the problem of constructing 2D centroidal Voronoi tessellations with constraints through an efficient and robust construction of bounded Voronoi diagrams, the pseudo-dual of the constrained Delaunay triangulation. We exploit the fact that the cells of the bounded Voronoi diagram can be obtained by clipping the ordinary ones against the constrained Delaunay edges. The clipping itself is efficiently computed by identifying for each constrained edge the (connected) set of triangles whose dual Voronoi vertex is hidden by the constraint. The resulting construction is amenable to Lloyd relaxation so as to obtain a centroidal tessellation with constraints.
Document type :
Journal articles
Complete list of metadata
Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Wednesday, December 29, 2010 - 11:47:09 AM
Last modification on : Thursday, January 20, 2022 - 5:31:46 PM
Long-term archiving on: : Friday, December 2, 2016 - 7:35:00 PM


Files produced by the author(s)




Jane Tournois, Pierre Alliez, Olivier Devillers. 2D Centroidal Voronoi Tessellations with Constraints. Numerical mathematics : a journal of Chinese universities, Nanjing University Press, 2010, 3 (2), pp.212--222. ⟨10.4208/nmtma.2010.32s.6⟩. ⟨inria-00523812v2⟩



Record views


Files downloads