Combining Topological Simplification and Topology Preserving Compression for 2D Vector Fields

Authors:
Holger Theisel;Christian Rössl;Hans-Peter Seidel
Affiliations:
-;-;-
Venue:
PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
Year:
2003

Citing 10
Cited 1

Representation and Display of Vector Field Topology in Fluid Flow Data Sets

Computer
Collapsing flow topology using area metrics

VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Topology preserving compression of 2D vector fields

Proceedings of the conference on Visualization '00
A topology simplification method for 2D vector fields

Proceedings of the conference on Visualization '00
Continuous topology simplification of planar vector fields

Proceedings of the conference on Visualization '01
Visualizing Nonlinear Vector Field Topology

IEEE Transactions on Visualization and Computer Graphics
Feature Extraction of Separation and Attachment Lines *

IEEE Transactions on Visualization and Computer Graphics
Detection and Visualization of Closed Streamlines in Planar Flows

IEEE Transactions on Visualization and Computer Graphics
Topology-Preserving Smoothing of Vector Fields

IEEE Transactions on Visualization and Computer Graphics
Feature flow fields

VISSYM '03 Proceedings of the symposium on Data visualisation 2003

Energy-scale aware feature extraction for flow visualization

EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Topological simplification techniques and topology preserving compression approaches for 2D vector fields have been developed quite independently of each other. In this paper we propose a combination of both approaches: a vector field should be compressed in such a way that its important topological features (both critical points and separatrices) are preserved while its unimportant features are allowed to collapse and disappear. To do so, a number of new solutions and modi.cations of pre-existing algorithms are presented. We apply the approach to a flow data set which, is both large and topologically complex, and achieve significant compression ratios there.