2D Centroidal Voronoi Tessellations with Constraints - Archive ouverte HAL Access content directly
Journal Articles Numerical mathematics : a journal of Chinese universities Year : 2010

2D Centroidal Voronoi Tessellations with Constraints

(1) , (1) , (1)
1
Jane Tournois
  • Function : Author
  • PersonId : 857875
Pierre Alliez
Olivier Devillers

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.
Fichier principal
Vignette du fichier
centroidal-vd.pdf (17.95 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00523812 , version 1 (06-10-2010)
inria-00523812 , version 2 (29-12-2010)

Identifiers

Cite

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

Collections

INRIA INRIA2
1015 View
1460 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More