Centroidal Voronoi Tessellation of Line Segments and Graphs

Centroidal Voronoi Tessellation (CVT) of points has many applications in geometry processing, including re‐meshing and segmentation, to name but a few. In this paper, we generalize the CVT concept to graphs via a variational characterization. Given a graph and a 3D polygonal surface, our method opti...

Full description

Saved in:

Bibliographic Details
Published in:	Computer graphics forum Vol. 31; no. 2pt4; pp. 775 - 784
Main Authors:	Lu, Lin, Lévy, Bruno, Wang, Wenping
Format:	Journal Article
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.05.2012
Subjects:	Algorithms and systems Approximation Computer graphics Computer Graphics [I.3.5]: Computational Geometry and Object Modeling-Geometric algorithms Computer Graphics [I.3.5]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems; Algorithms Computer science Geometry Graphs languages Names Segmentation Segments Studies Tessellation Three dimensional Triangles
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!