Sciweavers

Share
VIS
2004
IEEE

Centroidal Voronoi Tessellation Based Algorithms for Vector Fields Visualization and Segmentation

9 years 8 months ago
Centroidal Voronoi Tessellation Based Algorithms for Vector Fields Visualization and Segmentation
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. CR Categories: I.4.6 [Computing Methodologies]: Image Processing...
Qiang Du, Xiaoqiang Wang
Added 05 Nov 2009
Updated 05 Nov 2009
Type Conference
Year 2004
Where VIS
Authors Qiang Du, Xiaoqiang Wang
Comments (0)
books