## Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds (2001)

### Cached

### Download Links

- [www.cs.duke.edu]
- [www.cs.dartmouth.edu]
- [www.cs.duke.edu]
- []
- DBLP

### Other Repositories/Bibliography

Citations: | 47 - 5 self |

### BibTeX

@MISC{Edelsbrunner01hierarchicalmorse,

author = {Herbert Edelsbrunner and John Harer and Afra Zomorodian},

title = {Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds},

year = {2001}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in the smooth category, we extend the construction to the piecewise linear category by ensuring structural integrity and simulating differentiability. We then simplify Morse complexes by cancelling pairs of critical points in order of increasing persistence. Keywords Computational topology, PL manifolds, Morse theory, topological persistence, hierarchy, algorithms, implementation, terrains 1. INTRODUCTION In this paper, we define the Morse complex decomposing a piecewise linear 2-manifold and present algorithms for constructing and simplifying this complex. 1.1 Motivation Physical simulation problems often start with a space and measurements over this space. If the measurements are scalar values, we talk about a height function of that space. We use this name throughout the paper, although the functions can ...

### Citations

456 |
Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams
- Guibas, Stol
- 1985
(Show Context)
Citation Context ...crease the degree of the previously created junction. Case (c) is the PL counterpart of a non-transversal intersection between a stable and an unstable 1-manifold. We use the quad edge data structure =-=[9]-=- to store the complex defined by the paths. The vertices of the complex are the critical points and junctions, and the arcs are the pairwise edge-disjoint paths connecting these vertices. Extending pa... |

276 | Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms
- Edelsbrunner, Mücke
- 1990
(Show Context)
Citation Context ...nction is thus defined by its values at the vertices of K. It will be convenient to assume h(u) #= h(v) for all vertices u #= v in K. We simulate simplicity to justify this assumption computationally =-=[8]-=-. 3 In a triangulation, the natural concept of a neighborhood of a vertex u is the star, St u, that consists of u together with the edges and triangles that share u as a vertex. Formally, St u = {# # ... |

235 | Topological persistence and simplification
- Edelsbrunner, Letscher, et al.
(Show Context)
Citation Context ...rchy of complexes by eliminating critical points with measure below a threshold. In this section, we describe a measure called persistence and discuss its computation. Further details may be found in =-=[7]-=-. Filtration and Betti numbers. Assume we assemble the triangulation K of a connected compact 2-manifold without boundary M by adding simplices in the order of increasing height. Let u 1 , u 2 , . . .... |

131 | Computing contour trees in all dimensions
- Carr, Snoeyink, et al.
(Show Context)
Citation Context ...R over a two-dimensional domain D. We can visualize h by discrete set of iso-lines h -1 (c) of constant height values. The topological structure of iso-lines is partially captured by the contour tree =-=[3, 4, 14]-=-. If h is differentiable, we may define the gradient field consisting of vectors in the direction of the steepest ascent. Researchers in visualization have studied this vector field for some time [1, ... |

119 | R.: Contour trees and small seed sets for isosurface traversal
- KREVELD, OOSTRUM, et al.
- 1997
(Show Context)
Citation Context ...R over a two-dimensional domain D. We can visualize h by discrete set of iso-lines h -1 (c) of constant height values. The topological structure of iso-lines is partially captured by the contour tree =-=[3, 4, 14]-=-. If h is differentiable, we may define the gradient field consisting of vectors in the direction of the steepest ascent. Researchers in visualization have studied this vector field for some time [1, ... |

93 | An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Computer Aided Geometric Design
- nado, Edelsbrunner
- 1995
(Show Context)
Citation Context ...n 1 , and # 2 = # n 2 = 1 are the Betti numbers of K = K n . The Betti numbers of K j+1 can be computed from those of K j merely by looking at the type of u j+1 and how its lower star connects to K j =-=[6]-=-. It is convenient to adopt reduced homology groups, but we will freely talk about components and holes when we mean reduced homology classes of non-bounding 0- and 1-cycles. We start with # 0 -1 = 1 ... |

84 |
Critical points and curvature for embedded polyhedral surfaces
- Banchoff
- 1970
(Show Context)
Citation Context ... = {# # K | u # #}, where u # # is short for u being a face of #. Since all vertices have different heights, each edge and triangle has a unique lowest and a unique highest vertex. Following Banchoff,=-=[2]-=- we use this to define the lower and upper stars of u, St u = {# # St u | h(v) # h(u), v # #}, St u = {# # St u | h(v) # h(u), v # #}, These subsets of the star contain the simplices that have u as th... |

59 |
H.: A topology simplification method for 2D vector fields
- TRICOCHE, SCHEUERMANN, et al.
(Show Context)
Citation Context ... 14]. If h is differentiable, we may define the gradient field consisting of vectors in the direction of the steepest ascent. Researchers in visualization have studied this vector field for some time =-=[1, 5, 13]-=-. The Morse complex captures the characteristics of this vector field by decomposing the manifold into cells of uniform flow. As such, the Morse complex represents a full analysis of the behavior of t... |

52 | Liere, “Collapsing Flow Topology Using Area Metrics
- Leeuw, van
- 1999
(Show Context)
Citation Context ... 14]. If h is differentiable, we may define the gradient field consisting of vectors in the direction of the steepest ascent. Researchers in visualization have studied this vector field for some time =-=[1, 5, 13]-=-. The Morse complex captures the characteristics of this vector field by decomposing the manifold into cells of uniform flow. As such, the Morse complex represents a full analysis of the behavior of t... |

51 | Visualization of scalar topology for structural enhancement
- Bajaj, Pascucci, et al.
- 1998
(Show Context)
Citation Context ... 14]. If h is differentiable, we may define the gradient field consisting of vectors in the direction of the steepest ascent. Researchers in visualization have studied this vector field for some time =-=[1, 5, 13]-=-. The Morse complex captures the characteristics of this vector field by decomposing the manifold into cells of uniform flow. As such, the Morse complex represents a full analysis of the behavior of t... |

33 |
Kreveld. Trekking in the Alps Without Freezing or Getting Tired
- Berg, van
- 1997
(Show Context)
Citation Context ...R over a two-dimensional domain D. We can visualize h by discrete set of iso-lines h -1 (c) of constant height values. The topological structure of iso-lines is partially captured by the contour tree =-=[3, 4, 14]-=-. If h is differentiable, we may define the gradient field consisting of vectors in the direction of the steepest ascent. Researchers in visualization have studied this vector field for some time [1, ... |

19 | Conley index theory, in - Mischaikow, Mrozek |

10 |
Data Announcement 88-MGG-02, Digital relief of the Surface of the Earth
- NOAA
- 1988
(Show Context)
Citation Context ...nce of critical points. We shall add experimental results for the remaining algorithms as they become available. Data sets. We use three rectangle sections of rectilinear grid elevation data of Earth =-=[12]-=- and one synthetic data sampled from h(x, y) = sin x + sin y for input. The names and sizes of the data sets are given in Table 1. In each case, we convert the gridded rectangle into a triangulated sp... |