DocumentCode
2183798
Title
Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation
Author
Du, Qiang ; Wang, Xiaoqiang
Author_Institution
Dept. of Math., Pennsylvania State Univ., University Park, PA, USA
fYear
2004
fDate
10-15 Oct. 2004
Firstpage
43
Lastpage
50
Abstract
A new method for the simplification and the visualization of vector fields is presented based on the notion of centroidal Voronoi tessellations (CVT´s). A CVT is a special Voronoi tessellation for which the generators of the Voronoi regions in the tessellation are also the centers of mass (or means) with respect to a prescribed density. A distance function in both the spatial and vector spaces is introduced to measure the similarity of the spatially distributed vector fields. Based on such a distance, vector fields are naturally clustered and their simplified representations are obtained. Our method combines simple geometric intuitions with the rigorously established optimality properties of the CVTs. It is simple to describe, easy to understand and implement. Numerical examples are also provided to illustrate the effectiveness and competitiveness of the CVT-based vector simplification and visualization methodology.
Keywords
computational geometry; data visualisation; flow visualisation; image segmentation; pattern clustering; centroidal Voronoi tessellations; flow visualization; image segmentation; vector field visualization; vector simplification; Computer vision; Convolution; Data flow computing; Data mining; Data visualization; Displays; Image segmentation; Mathematics; Noise shaping; Statistical distributions;
fLanguage
English
Publisher
ieee
Conference_Titel
Visualization, 2004. IEEE
Print_ISBN
0-7803-8788-0
Type
conf
DOI
10.1109/VISUAL.2004.13
Filename
1372178
Link To Document