loading...
Centroidal Voronoi Tessellation Based Algorithms for Vector Fields Visualization and Segmentation
Austin, Texas October 10-October 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/VISUAL.2004.1315th IEEE Visualization 2004 (VIS 2004)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Qiang Du, Pennsylvania State University
Xiaoqiang Wang, Pennsylvania State University
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.
Index Terms:
Flow Visualization, Vector Field, Simplification, Segmentation, Clustering, Centroidal Voronoi tessellation
Citation:
Qiang Du, Xiaoqiang Wang, "Centroidal Voronoi Tessellation Based Algorithms for Vector Fields Visualization and Segmentation," vis, pp.43-50, 15th IEEE Visualization 2004 (VIS 2004), 2004
Usage of this product signifies your acceptance of the Terms of Use.