2D Vector field approximation using linear neighborhoods

Abstract

We present a vector field approximation for two-dimensional vector fields that preserves their topology and significantly reduces the memory footprint. This approximation is based on a segmentation. The flow within each segmentation region is approximated by an affine linear function. The implementation is driven by four aims: (1) the approximation preserves the original topology; (2) the maximal approximation error is below a user-defined threshold in all regions; (3) the number of regions is as small as possible; and (4) each point has the minimal approximation error. The generation of an optimal solution is computationally infeasible. We discuss this problem and provide a greedy strategy to efficiently compute a sensible segmentation that considers the four aims. Finally, we use the region-wise affine linear approximation to compute a simplified grid for the vector field.