2015
DOI: 10.1117/12.2080196
|View full text |Cite
|
Sign up to set email alerts
|

An image-space Morse decomposition for 2D vector fields

Abstract: Morse decompositions have been proposed to compute and represent the topological structure of steady vector fields. Compared to the conventional differential topology, Morse decomposition and the resulting Morse Connection Graph (MCG) is numerically stable. However, the granularity of the original Morse decomposition is constrained by the resolution of the underlying spatial discretization, which typically results in non-smooth representation. In this work, an Image-Space Morse decomposition (ISMD) framework i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…In the second stage, we sub-divide the voxels that fall in the resulting Morse sets from the first stage and re-compute the local Morse decomposition within each Morse set region with a higher grid resolution. This enables us to partially improve the smoothness of the Morse set boundaries for visualization, which is in a much similar spirit of the image-space Morse decomposition framework [5]. In particular, our refinement framework can be described as follows.…”
Section: Hierarchical Refinementmentioning
confidence: 99%
See 1 more Smart Citation
“…In the second stage, we sub-divide the voxels that fall in the resulting Morse sets from the first stage and re-compute the local Morse decomposition within each Morse set region with a higher grid resolution. This enables us to partially improve the smoothness of the Morse set boundaries for visualization, which is in a much similar spirit of the image-space Morse decomposition framework [5]. In particular, our refinement framework can be described as follows.…”
Section: Hierarchical Refinementmentioning
confidence: 99%
“…This integration time will be increased gradually at regions that may contain flow recurrent dynamics to refine the obtained results. In addition, our refinement framework borrows ideas from the recently introduced image-space Morse decomposition for 2D vector fields [5], and procedurally sub-divides the 3D cells to refine the boundary of the obtained Morse sets. Since the input vector fields are defined on regular grids, a CUDA implementation of our framework is possible, which largely improves the computation performance of our framework.…”
Section: Introductionmentioning
confidence: 99%