A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality

@article{Gyulassy2008APA,
  title={A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality},
  author={A. Gyulassy and P. Bremer and B. Hamann and Valerio Pascucci},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  year={2008},
  volume={14},
  pages={1619-1626}
}
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for large scale data remains a challenging problem. We describe a new algorithm and easily extensible framework for computing MS complexes for large scale data of any dimension where scalar values are given at the vertices of a closure-finite and weak topology (CW) complex, therefore enabling computation on a wide variety of… Expand
Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy
TLDR
This work presents a new approach that combines parallel streamline computation with combinatorial methods to construct a high-quality discrete Morse-Smale complex and allows users to selectively build a subset of features using high- quality geometry. Expand
The Parallel Computation of Morse-Smale Complexes
TLDR
This paper develops a two-stage algorithm to construct the 1-skeleton of the Morse-Smale complex in parallel, the first stage independently computing local features per block and the second stage merging to resolve global features. Expand
Combinatorial construction of morse-smale complexes for data analysis and visualization
Scientific data is becoming increasingly complex, and sophisticated techniques are required for its effective analysis and visualization. The Morse-Smale complex is an efficient data structure thatExpand
Practical Considerations in Morse-Smale Complex Computation
TLDR
This work identifies the cause of spurious critical points due to simulation of simplicity, and presents a general technique for solving it; improves simplification performance by reordering critical point cancellation operations and introducing an efficient data structure for storing the arcs of the Morse-Smale complex. Expand
Efficient Software for Programmable Visual Analysis Using Morse-Smale Complexes
TLDR
Two open source software modules for the computation, analysis, and visualization of scientific data using the Morse-Smale complex are presented and the ability to couple the visual analysis and the computation with ParaView, a popular general purpose visualization tool is highlighted. Expand
Parallel Computation of 2D Morse-Smale Complexes
TLDR
An algorithm that processes all mesh elements of the domain in parallel to compute the Morse-Smale complex of large 2D datasets at interactive speeds and achieves scalability by computing the discrete gradient using local accesses only is described. Expand
Computing Morse-Smale Complexes with Accurate Geometry
TLDR
Two new algorithms are introduced: a randomized algorithm to compute the discrete gradient of a scalar field that converges under refinement; and a deterministic variant which directly computes accurate geometry and thus correct connectivity of the MS complex. Expand
Robust computation of Morse-Smale complexes of bilinear functions
TLDR
A new combinatorial algorithm to compute MS complexes for two-dimensional piecewise bilinear functions defined on quadrilateral meshes is presented and a new invariant of the gradient flow within a bilinears cell is derived to develop a provably correct computation, unaffected by numerical instabilities. Expand
Computing Accurate Morse-Smale Complexes from Gradient Vector Fields
TLDR
A technique is presented to convert a continuous gradient field to a dependency graph with weights on edges, and adapt the accurate Morse-Smale complex algorithm to this setting, which demonstrates the utility of the technique by computing accurate segmentations for both gradient vector fields obtained by sampling scalar functions as well as rotation-free vector fields. Expand
Conforming Morse-Smale Complexes
TLDR
A new combinatorial technique to compute an MS complex that conforms to both an input scalar field and an additional, prior segmentation of the domain, effectively resulting in anMS complex that is as geometrically accurate as the employed numerical integration. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Robust on-line computation of Reeb graphs: simplicity and speed
Reeb graphs are a fundamental data structure for understanding and representing the topology of shapes. They are used in computer graphics, solid modeling, and visualization for applications rangingExpand
Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions
TLDR
An algorithm is presented that constructs the Morse-Smale complex in a series of sweeps through the data, identifying various components of thecomplex in a consistent manner, providing a complete decomposition of the domain. Expand
A topological approach to simplification of three-dimensional scalar fields
This paper describes an efficient combinatorial method for simplification of topological features in a 3D scalar function. The Morse-Smale complex, which provides a succinct representation of aExpand
Applications of Forman's discrete Morse theory to topology visualization and mesh compression
TLDR
This work builds, visualize, and applies the basic elements of Forman's discrete Morse theory, and proves that the complexity class of the strategy optimization of Grow&Fold is MAX-SNP hard. Expand
A topological approach to simplification of three-dimensional scalar functions
This paper describes an efficient combinatorial method for simplification of topological features in a 3D scalar function. The Morse-Smale complex, which provides a succinct representation of aExpand
Topological volume skeletonization using adaptive tetrahedralization
TLDR
The paper presents an efficient method for accelerating the computation of topological volume skeletons using adaptive tetrahedralization, a top-down approach to linear interpolation of the scalar fields in that it selects tetrahedra to be subdivided adaptively using several criteria. Expand
A USER'S GUIDE TO DISCRETE MORSE THEORY
A number of questions from a variety of areas of mathematics lead one to the problem of analyzing the topology of a simplicial complex. However, there are few general techniques available to aid usExpand
Progressive meshes
TLDR
The progressive mesh (PM) representation is introduced, a new scheme for storing and transmitting arbitrary triangle meshes that addresses several practical problems in graphics: smooth geomorphing of level-of-detail approximations, progressive transmission, mesh compression, and selective refinement. Expand
A topological hierarchy for functions on triangulated surfaces
TLDR
This work combines topological and geometric methods to construct a multiresolution representation for a function over a two-dimensional domain and uses this data structure to extract topologically valid approximations that satisfy error bounds provided at runtime. Expand
Topology-based simplification for feature extraction from 3D scalar fields
TLDR
A combinatorial algorithm is designed that simplifies the Morse-Smale complex by repeated application of two atomic operations that remove pairs of critical points of the function and a visualization of the simplified topology is presented. Expand
...
1
2
3
4
...