construction of vector field hierarchies
We present a method for the hierarchical representation of vector fields. Our approach is based on iterative refinement using clustering and principal component analysis. The input to our algorithm is a discrete set of points with associated vectors. The algorithm generates a top-down segmentation of the discrete field by splitting clusters of points. We measure the error of the various approximation levels by measuring the discrepancy between streamlines generated by the original discrete field and its approximations based on much smaller discrete data sets. Our method assumes no particular structure of the field, nor does it require any topological connectivity information. It is possible to generate multiresolution representations of vector fields using this approach.
vectorization hierarchies hierarchic method representation iter refine cluster principal component analysis input algorithm point association segmentation measurement errors approximation data structure connection informal multiresolution vector field visualization hardy's multiquadric method binary-space partitioning data simplification