Efficient Morse decompositions of vector fields Public Deposited

http://ir.library.oregonstate.edu/concern/technical_reports/v692t7398

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Existing topology-based vector field analysis techniques rely on the ability to extract the individual trajectories such as fixed points, periodic orbits and separatrices which are sensitive to noise and errors introduced by simulation and interpolation. This can make such vector field analysis unsuitable for rigorous interpretations. We advocate the use of Morse decompositions, which are robust with respect to perturbations, to encode the topological structures of a vector field in the form of a directed graph, called a Morse connection graph (MCG). While an MCG exists for every vector field, it need not be unique. Previous techniques for computing MCG's, while fast, are overly conservative and usually results in MCG's that are too coarse to be useful for the applications. To address this issue, we present a new technique for performing Morse decomposition based on the concept of τ-maps, which typically provides finer MCG's than existing techniques. Furthermore, the choice of τ provides a natural tradeoff between the fineness of the MCG's and the computational costs. We provide efficient implementations of Morse decomposition based on τ-maps, which include the use of forward and backward mapping techniques and an adaptive approach in constructing better approximations of the images of the triangles in the meshes used for simulation. Furthermore, we propose the use of spatial τ-maps in addition to the original temporal τ-maps. These techniques provide additional tradeoffs between the quality of the MCG's and the speed of computation. We demonstrate the utility of our technique with various examples in plane and on surfaces including engine simulation datasets.
Resource Type
Date Available
Date Issued
Series
Keyword
Subject
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-12-18T23:04:34Z (GMT) No. of bitstreams: 1 2007-42.pdf: 3554967 bytes, checksum: 4e57c1816d30b3c29708ce31c086f4e5 (MD5)
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-12-18T23:03:03Z No. of bitstreams: 1 2007-42.pdf: 3554967 bytes, checksum: 4e57c1816d30b3c29708ce31c086f4e5 (MD5)
  • description.provenance : Made available in DSpace on 2012-12-18T23:04:34Z (GMT). No. of bitstreams: 1 2007-42.pdf: 3554967 bytes, checksum: 4e57c1816d30b3c29708ce31c086f4e5 (MD5) Previous issue date: 2007

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items