The Community for Technology Leaders
Green Image
Issue No. 12 - Dec. (2012 vol. 18)
ISSN: 1077-2626
pp: 2014-2022
A. Gyulassy , SCI Inst., Univ. of Utah, Salt Lake City, UT, USA
P. Bremer , Lawrence Livermore Nat. Lab., Lawrence, CA, USA
V. Pascucci , SCI Inst., Univ. of Utah, Salt Lake City, UT, USA
ABSTRACT
Topological techniques have proven highly successful in analyzing and visualizing scientific data. As a result, significant efforts have been made to compute structures like the Morse-Smale complex as robustly and efficiently as possible. However, the resulting algorithms, while topologically consistent, often produce incorrect connectivity as well as poor geometry. These problems may compromise or even invalidate any subsequent analysis. Moreover, such techniques may fail to improve even when the resolution of the domain mesh is increased, thus producing potentially incorrect results even for highly resolved functions. To address these problems we introduce two new algorithms: (i) a randomized algorithm to compute the discrete gradient of a scalar field that converges under refinement; and (ii) a deterministic variant which directly computes accurate geometry and thus correct connectivity of the MS complex. The first algorithm converges in the sense that on average it produces the correct result and its standard deviation approaches zero with increasing mesh resolution. The second algorithm uses two ordered traversals of the function to integrate the probabilities of the first to extract correct (near optimal) geometry and connectivity. We present an extensive empirical study using both synthetic and real-world data and demonstrates the advantages of our algorithms in comparison with several popular approaches.
INDEX TERMS
Geometry, Manifolds, Vectors, Algorithm design and analysis, Standards, Robustness, Topology, Morse-Smale complex, Topology, topological methods
CITATION
A. Gyulassy, P. Bremer, V. Pascucci, "Computing Morse-Smale Complexes with Accurate Geometry", IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. , pp. 2014-2022, Dec. 2012, doi:10.1109/TVCG.2012.209
92 ms
(Ver )