Compression of 2D Vector Fields Under Guaranteed Topology Preservation

Simple item page
dc.contributor.authorTheisel, H.en_US
dc.contributor.authorRossl, Ch.en_US
dc.contributor.authorSeidel, H.-P.en_US
dc.date.accessioned2015-02-16T08:00:52Z
dc.date.available2015-02-16T08:00:52Z
dc.date.issued2003en_US
dc.description.abstractIn this paper we introduce a new compression technique for 2D vector fields which preserves the complete topology, i.e., the critical points and the connectivity of the separatrices. As the theoretical foundation of the algorithm, we show in a theorem that for local modifications of a vector field, it is possible to decide entirely by a local analysis whether or not the global topology is preserved. This result is applied in a compression algorithm which is based on a repeated local modification of the vector field - namely a repeated edge collapse of the underlying piecewise linear domain. We apply the compression technique to a number of data sets with a complex topology and obtain significantly improved compression ratios in comparison to pre-existing topology-preserving techniques.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume22en_US
dc.identifier.doi10.1111/1467-8659.00680en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages333-342en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00680en_US
dc.publisherBlackwell Publishers, Inc and the Eurographics Associationen_US
dc.titleCompression of 2D Vector Fields Under Guaranteed Topology Preservationen_US
Files
Collections
Issue 3