2003
DOI: 10.1007/3-540-36586-9_25
|View full text |Cite
|
Sign up to set email alerts
|

Topological Analysis and Characterization of Discrete Scalar Fields

Abstract: Abstract. In this paper, we address the problem of analyzing the topology of discrete scalar fields defined on triangulated domains. To this aim, we introduce the notions of discrete gradient vector field and of Smalelike decomposition for the domain of a d-dimensional scalar field. We use such notions to extract the most relevant features representing the topology of the field. We describe a decomposition algorithm, which is independent of the dimension of the scalar field, and, based on it, methods for extra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 20 publications
(22 citation statements)
references
References 18 publications
0
22
0
Order By: Relevance
“…This representation encodes both the ascending and the descending complexes associated with a quasi-Morse complex. The incidence graph for a 3D scalar field can be constructed by applying the algorithm described in [5], which computes the two dual Morse complexes through an efficient discrete approach that does not involve any floating-point computation.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…This representation encodes both the ascending and the descending complexes associated with a quasi-Morse complex. The incidence graph for a 3D scalar field can be constructed by applying the algorithm described in [5], which computes the two dual Morse complexes through an efficient discrete approach that does not involve any floating-point computation.…”
Section: Discussionmentioning
confidence: 99%
“…In applications, large data sets are usually interpolated by a continuous function, and then topological features are extracted, which represent the initial data in a compact way. Morse-Smale complexes can be applied for segmenting the graph of a scalar field for terrain modeling in 2D, and recently some algorithms have been developed for segmenting three-dimensional scalar fields through Morse-Smale complexes [11,5]. For the review of work in this area, see [4] and the references therein.…”
Section: Introductionmentioning
confidence: 99%
“…In this Section, we describe a dimension independent region-based method, introduced in [4], for extracting an approximation of a descending Morse complex related to maxima, called a Smale-like decomposition, starting from a scalar field f defined on the vertices of a triangulated manifold domain Σ.…”
Section: The Smale-like Discrete Decompositionmentioning
confidence: 99%
“…Region growing algorithms [9,12,20] mimic, in the discrete case, the definition of 2-cell for a Morse complex, which is the set of the integral lines that originate or converge to a critical point. We discuss here how the algorithms extract the unstable Morse complex.…”
Section: Region-growing Algorithmsmentioning
confidence: 99%
“…The algorithm in [12], denoted here as DIS, is based on the elevation values at the TIN vertices, while the one in [11], denoted as GRD, is based on the gradient associated with the triangles. The algorithms sort the vertices according to their elevation and process them in decreasing elevation order.…”
Section: Region-growing Algorithmsmentioning
confidence: 99%