Efficient computation of clipped Voronoi diagram for mesh generation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer-Aided Design Year : 2011

Efficient computation of clipped Voronoi diagram for mesh generation

Dong-Ming Yan
  • Function : Author
  • PersonId : 885221
Wenping Wang
  • Function : Author
  • PersonId : 885224
Bruno Lévy
Yang Liu
  • Function : Author
  • PersonId : 885222

Abstract

The Voronoi diagram is a fundamental geometric structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact domain (i.e. a bounded and closed 2D region or a 3D volume), some Voronoi cells of their Voronoi diagram are infinite or partially outside of the domain, but in practice only the parts of the cells inside the domain are needed, as when computing the centroidal Voronoi tessellation. Such a Voronoi diagram confined to a compact domain is called a clipped Voronoi diagram. We present an efficient algorithm to compute the clipped Voronoi diagram for a set of sites with respect to a compact 2D region or a 3D volume. We also apply the proposed method to optimal mesh generation based on the centroidal Voronoi tessellation.
Fichier principal
Vignette du fichier
main.pdf (27.34 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00647979 , version 1 (05-12-2011)

Identifiers

Cite

Dong-Ming Yan, Wenping Wang, Bruno Lévy, Yang Liu. Efficient computation of clipped Voronoi diagram for mesh generation. Computer-Aided Design, 2011, ⟨10.1016/j.cad.2011.09.004⟩. ⟨hal-00647979⟩
304 View
2461 Download

Altmetric

Share

Gmail Facebook X LinkedIn More