Centroidal Voronoi Tesselation of Line Segments and Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

Centroidal Voronoi Tesselation of Line Segments and Graphs

Abstract

Centroidal Voronoi Tesselation (CVT) of points has many applications in geometry processing, including re-meshing and segmentation to name but a few. In this paper, we propose a new extension of CVT, generalized to graphs. Given a graph and a 3D polygonal surface, our method optimizes the placement of the vertices of the graph in such a way that the graph segments best approximate the shape of the surface. We formulate the computation of CVT for graphs as a continuous variational problem, and present a simple approximated method to solve this problem. Our method is robust in the sense that it is independent of degeneracies in the input mesh, such as skinny triangles, T-junctions, small gaps or multiple connected components. We present some applications, to skeleton fitting and to shape segmentation.
Fichier principal
Vignette du fichier
CVTGraph.pdf (4.28 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00600255 , version 1 (14-06-2011)

Identifiers

  • HAL Id : inria-00600255 , version 1

Cite

Lin Lu, Bruno Lévy, Wenping Wang. Centroidal Voronoi Tesselation of Line Segments and Graphs. [Research Report] 2009. ⟨inria-00600255⟩
184 View
775 Download

Share

Gmail Facebook X LinkedIn More