# Practical Considerations in Morse-Smale Complex Computation

@inproceedings{Gyulassy2011PracticalCI, title={Practical Considerations in Morse-Smale Complex Computation}, author={A. Gyulassy and P. Bremer and B. Hamann and Valerio Pascucci}, booktitle={Topological Methods in Data Analysis and Visualization}, year={2011} }

The Morse-Smale complex is an effective topology-based representation for identifying, ordering, and selectively removing features in scalar-valued data. Several algorithms are known for its effective computation, however, common problems pose practical challenges for any feature-finding approach using the Morse-Smale complex. We identify these problems and present practical solutions: (1) we identify the cause of spurious critical points due to simulation of simplicity, and present a general… Expand

#### Figures, Tables, and Topics from this paper

#### 19 Citations

The Parallel Computation of Morse-Smale Complexes

- Computer Science
- 2012 IEEE 26th International Parallel and Distributed Processing Symposium
- 2012

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

Notes on the Simplification of the Morse-Smale Complex

- Computer Science, Mathematics
- Topological Methods in Data Analysis and Visualization
- 2014

The Morse-Smale complex can be either explicitly or implicitly represented. Depending on the type of representation, the simplification of the Morse-Smale complex works differently. In the explicit… Expand

Modeling Three-Dimensional Morse and Morse-Smale Complexes

- Mathematics, Computer Science
- Innovations for Shape Analysis, Models and Algorithms
- 2013

The problem of representing, constructing and simplifying Morse and Morse-Smale complexes in 3D, a suitable tool for modeling the topology of a manifold M through a decomposition of M induced by a scalar field f defined over M is considered. Expand

Computing Morse-Smale Complexes with Accurate Geometry

- Computer Science, Medicine
- IEEE Transactions on Visualization and Computer Graphics
- 2012

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

Dimension-independent multi-resolution Morse complexes

- Mathematics, Computer Science
- Comput. Graph.
- 2012

A dimension-independent multi-resolution model for Morse complexes built on a graph representation of the complexes, that is a Multi-Resolution Morse Incidence Graph (MMIG), is proposed. Expand

Simplification and Multi-Resolution Representations

- Computer Science
- 2014

This chapter describes and compares simplification operators on Morse functions and Morse and Morse-Smale complexes, and presents multi-resolution models for the morphology of scalar fields and addresses the problem of coupling a multi- resolution representation of geometry and of morphology in 2D. Expand

Computing discrete Morse complexes from simplicial complexes

- Computer Science, Mathematics
- Graph. Model.
- 2019

A new algorithm for computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size is designed and implemented and it is shown that this approach scales very well with the size and the dimension of the simplicial complex. Expand

Morse complexes for shape segmentation and homological analysis: discrete models and algorithms

- Mathematics, Computer Science
- Comput. Graph. Forum
- 2015

This survey reviews, classify and analyze algorithms for computing and simplifying Morse complexes in the context of such applications with an emphasis on discrete Morse theory and on algorithms based on it. Expand

Simplification Operators on a Dimension-Independent Graph-Based Representation of Morse Complexes

- Computer Science
- ISMM
- 2013

A simplification algorithm is developed based on a simplification operator that operates on the Morse incidence graph, which is atomic and dimension-independent and shows results from this implementation as well as comparisons with the cancellation operator in 3D. Expand

Efficient Computation of a Hierarchy of Discrete 3D Gradient Vector Fields

- Mathematics
- 2012

This paper introduces a novel combinatorial algorithm to compute a hierarchy of discrete gradient vector fields for three-dimensional scalar fields. The hierarchy is defined by an importance measure… Expand

#### References

SHOWING 1-10 OF 14 REFERENCES

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

- Computer Science, Medicine
- IEEE Transactions on Visualization and Computer Graphics
- 2008

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 meshes such as regular grids, simplicial meshes, and adaptive multiresolution (AMR) meshes is described. Expand

Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions

- Mathematics, Medicine
- IEEE Transactions on Visualization and Computer Graphics
- 2007

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

- 2006

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 a… Expand

A topological approach to simplification of three-dimensional scalar functions

- Computer Science, Medicine
- IEEE Transactions on Visualization and Computer Graphics
- 2006

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 a… Expand

Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2003

Algorithm for constructing a hierarchy of increasingly coarse Morse—Smale complexes that decompose a piecewise linear 2-manifold by canceling pairs of critical points in order of increasing persistence is presented. Expand

Topology-based simplification for feature extraction from 3D scalar fields

- Computer Science
- VIS 05. IEEE Visualization, 2005.
- 2005

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

Morse-smale complexes for piecewise linear 3-manifolds

- Computer Science, Mathematics
- SCG '03
- 2003

A combinatorial algorithm is given for constructing Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. Expand

Applications of Forman's discrete Morse theory to topology visualization and mesh compression

- Computer Science, Medicine
- IEEE Transactions on Visualization and Computer Graphics
- 2004

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 hierarchy for functions on triangulated surfaces

- Computer Science, Medicine
- IEEE Transactions on Visualization and Computer Graphics
- 2004

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

Generating Discrete Morse Functions from Point Data

- Mathematics, Computer Science
- Exp. Math.
- 2005

If K is a finite simplicial complex and h is an injective map from the vertices of K to ℝ, we show how to extend h to a discrete Morse function in the sense of Forman [Forman 02] in a reasonably… Expand