Efficient computation of clipped Voronoi diagram for mesh generation

Dong-Ming Yan 1 Wenping Wang 2 Bruno Lévy 1 Yang Liu 1
1 ALICE - Geometry and Lighting
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 Computer Graphics Group
Department of Computer Science [Hong Kong]
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.
Type de document :
Article dans une revue
Computer-Aided Design, Elsevier, 2011, 〈10.1016/j.cad.2011.09.004〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00647979
Contributeur : Dongming Yan <>
Soumis le : lundi 5 décembre 2011 - 11:49:34
Dernière modification le : jeudi 11 janvier 2018 - 06:20:18
Document(s) archivé(s) le : mardi 6 mars 2012 - 02:21:30

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Dong-Ming Yan, Wenping Wang, Bruno Lévy, Yang Liu. Efficient computation of clipped Voronoi diagram for mesh generation. Computer-Aided Design, Elsevier, 2011, 〈10.1016/j.cad.2011.09.004〉. 〈hal-00647979〉

Partager

Métriques

Consultations de la notice

397

Téléchargements de fichiers

1884