The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2012 vol.18)
pp: 767-782
Guoning Chen , Sci. Comput. & Imaging Inst., Univ. of Utah, Salt Lake City, UT, USA
Qingqing Deng , Sch. of Electr. Eng. & Comput. Sci, Oregon State Univ., Corvallis, OR, USA
A. Szymczak , Dept. of Math. & Comput. Sci., Colorado Sch. of Mines, Golden, CO, USA
R. S. Laramee , Dept. of Comput. Sci., Swansea Univ., Swansea, UK
E. Zhang , Sch. of Electr. Eng. & Comput. Sci, Oregon State Univ., Corvallis, OR, USA
ABSTRACT
Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is not unique, and its granularity directly impacts its computational cost. In this paper, we propose an automatic refinement scheme to construct the Morse Connection Graph (MCG) of a given vector field in a hierarchical fashion. Our framework allows a Morse set to be refined through a local update of the flow combinatorialization graph, as well as the connection regions between Morse sets. The computation is fast because the most expensive computation is concentrated on a small portion of the domain. Furthermore, the present work allows the generation of a topologically consistent hierarchy of MCGs, which cannot be obtained using a global method. The classification of the extracted Morse sets is a crucial step for the construction of the MCG, for which the Poincaré index is inadequate. We make use of an upper bound for the Conley index, provided by the Betti numbers of an index pair for a translation along the flow, to classify the Morse sets. This upper bound is sufficiently accurate for Morse set classification and provides supportive information for the automatic refinement process. An improved visualization technique for MCG is developed to incorporate the Conley indices. Finally, we apply the proposed techniques to a number of synthetic and real-world simulation data to demonstrate their utility.
INDEX TERMS
vectors, data visualisation, graph theory, mathematics computing, numerical stability, pattern classification, set theory, topology, real-world simulation data, Morse set classification, hierarchical refinement, Conley index, Morse decomposition, vector field, numerically stable topological representation, Morse connection graph, flow combinatorialization graph, Poincare index, Betti numbers, visualization technique, synthetic data, Indexes, Topology, Orbits, Approximation methods, Upper bound, Trajectory, Electrocardiography, hierarchical refinement., Morse decomposition, vector field topology, upper bound of Conley index, topology refinement
CITATION
Guoning Chen, Qingqing Deng, A. Szymczak, R. S. Laramee, E. Zhang, "Morse Set Classification and Hierarchical Refinement Using Conley Index", IEEE Transactions on Visualization & Computer Graphics, vol.18, no. 5, pp. 767-782, May 2012, doi:10.1109/TVCG.2011.107
REFERENCES
[1] G. Chen, K. Mischaikow, R.S. Laramee, P. Pilarczyk, and E. Zhang, "Vector Field Editing and Periodic Orbit Extraction Using Morse Decomposition," IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 4, pp. 769-785, July/Aug. 2007.
[2] G. Chen, K. Mischaikow, R.S. Laramee, and E. Zhang, "Efficient Morse Decompositions of Vector Fields," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 4, pp. 848-862, July/Aug. 2008.
[3] C. Conley, "Isolated Invariant Sets and the Morse Index," CMBS Regional Conf. Series in Math., vol. 38, 1978.
[4] W. de Leeuw and R. van Liere, "Visualization of Global Flow Structures Using Multiple Levels of Topology," Proc. Symp. Data Visualization '99 (VisSym '99), pp. 45-52, May 1999.
[5] W. de Leeuw and R. van Liere, "Multi-Level Topology for Flow Visualization," Computers and Graphics, vol. 24, no. 3, pp. 325-331, June 2000.
[6] W. de Leeuw and R. van Liere, "Collapsing Flow Topology Using Area Metrics," Proc. IEEE Visualization '99, D. Ebert, M. Gross, and B. Hamann, eds., pp. 349-354, 1999.
[7] A. Dold, Lectures on Algebraic Topology. Springer-Verlag, 1980.
[8] H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, "Morse-Smale Complexes for Piecewise Linear 3-Manifolds," SCG '03: Proc. 19th Ann. Symp. Computational Geometry, pp. 361-370, 2003.
[9] H. Edelsbrunner, J. Harer, and A. Zomorodian, "Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds," SCG '01: Proc. 17th Ann. Symp. Computational Geometry, pp. 70-79, 2001.
[10] R. Forman, "Combinatorial Vector Fields and Dynamical Systems," Mathematische Zeitschrift, vol. 228, pp. 629-681, 1998.
[11] C. Garth, R.S. Laramee, X. Tricoche, J. Schneider, and H. Hagen, "Extraction and Visualization of Swirl and Tumble Motion from Engine Simulation Data," Topology-Based Methods in Visualization, Math. and Visualization, H. Hauser, H. Hagen, and H. Theisel, eds., pp. 121-135, Springer, 2007.
[12] A. Gyulassy, P.-T. Bremer, B. Hamann, and V. Pascucci, "A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 6, pp. 1619-1626, Nov./Dec. 2008.
[13] A. Gyulassy, V. Natarajan, V. Pascucci, and B. Hamann, "Efficient Computation of Morse-Smale Complexes for Three-Dimensional Scalar Functions," IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 6, pp. 1440-1447, Nov./Dec. 2007.
[14] J.L. Helman and L. Hesselink, "Representation and Display of Vector Field Topology in Fluid Flow Data Sets," Computer, vol. 22, no. 8, pp. 27-36, Aug. 1989.
[15] T. Kaczynski, K. Mischaikow, and M. Mrozek, Computational Homology, Vol. 157 of Applied Mathematical Sciences, Springer, 2004.
[16] W.D. Kalies, K. Mischaikow, and R.C.A.M. VanderVorst, "An Algorithmic Approach to Chain Recurrence," Foundations of Computational Math., vol. 5, no. 4, pp. 409-449, 2005.
[17] R. Laramee, H. Hauser, L. Zhao, and F.H. Post, "Topology Based Flow Visualization: The State of The Art," Topology-Based Methods in Visualization, pp. 1-19, Springer, 2007.
[18] R.S. Laramee, C. Garth, H. Doleisch, J. Schneider, H. Hauser, and H. Hagen, "Visual Analysis and Exploration of Fluid Flow in a Cooling Jacket," Proc. IEEE Visualization, pp. 623-630, 2005.
[19] R.S. Laramee, H. Hauser, H. Doleisch, F.H. Post, B. Vrolijk, and D. Weiskopf, "The State of the Art in Flow Visualization: Dense and Texture-Based Techniques," Computer Graphics Forum, vol. 23, no. 2, pp. 203-221, June 2004.
[20] R.S. Laramee, D. Weiskopf, J. Schneider, and H. Hauser, "Investigating Swirl and Tumble Flow with a Comparison of Visualization Techniques," Proc. IEEE Visualization '04, pp. 51-58, 2004.
[21] M. Mrozek, "Index Pairs and the Fixed Point Index for Semi-Dynamical Systems with Discrete Time," Fundamentals of Math., vol. 133, pp. 178-192, 1988.
[22] M. Mrozek, "Leray Functor and Cohomological Conley Index for Discrete Dynamical Systems," Trans. Am. Math. Soc., vol. 318, pp. 149-178, 1990.
[23] K. Polthier and E. Preuß, "Identifying Vector Fields Singularities Using a Discrete Hodge Decomposition," Math. Visualization III, H.C. Hege, and K. Polthier, eds., pp. 112-134, Springer, 2003.
[24] W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C: The Art of Scientific Computing. Cambridge Univ. Press, 1992.
[25] J. Reininghaus, C. Lowen, and I. Hotz, "Fast Combinatorial Vector Field Topology," IEEE Trans. Visualization and Computer Graphics, vol. 17, no. 10, pp. 1433-1443, Oct. 2011.
[26] G. Scheuermann, H. Hagen, H. Krüger, M. Menzel, and A. Rockwood, "Visualization of Higher Order Singularities in Vector Fields," Proc. IEEE Visualization '97, pp. 67-74, Oct. 1997.
[27] G. Scheuermann, H. Krüger, M. Menzel, and A.P. Rockwood, "Visualizing Nonlinear Vector Field Topology," IEEE Trans. Visualization and Computer Graphics, vol. 4, no. 2, pp. 109-116, Apr. 1998.
[28] A. Szymczak, "Index Pairs: From Dynamics to Combinatorics and Back," PhD thesis, Georgia Inst. of Tech nology, 1999.
[29] A. Szymczak and E. Zhang, "Robust Morse Decompositions of Piecewise Constant Vector Fields," IEEE Trans. Visualization and Computer Graphics, to Appear, 2011.
[30] H. Theisel, C. Rössl, and H.-P. Seidel, "Combining Topological Simplification and Topology Preserving Compression for 2D Vector Fields," Proc. Pacific Conf. Computer Graphics and Applications, pp.419-423, 2003.
[31] H. Theisel, C. Rössl, and H.-P. Seidel, "Compression of 2D Vector Fields under Guaranteed Topology Preservation," Computer Graphics Forum, vol. 22, no. 3, pp. 333-342, Sept. 2003.
[32] H. Theisel, T. Weinkauf, and H.-P. Seidel, "Grid-Independent Detection of Closed Stream Lines in 2D Vector Fields," Proc. Conf. Vision, Modeling and Visualization (VMV '04), pp. 421-428, Nov. 2004.
[33] Y. Tong, S. Lombeyda, A. Hirani, and M. Desbrun, "Discrete Multiscale Vector Field Decomposition," ACM Trans. Graphics, vol. 22, pp. 445-452, July 2003.
[34] X. Tricoche, G. Scheuermann, and H. Hagen, "A Topology Simplification Method for 2D Vector Fields," Proc. IEEE Visualization, pp. 359-366, 2000.
[35] X. Tricoche, G. Scheuermann, and H. Hagen, "Continuous Topology Simplification of Planar Vector Fields," Proc. IEEE Visualization, pp. 159-166, 2001.
[36] X. Tricoche, G. Scheuermann, and H. Hagen, "Topology-Based Visualization of Time-Dependent 2D Vector Fields," Proc. Joint Eurographics - IEEE TCVG Symp. Visualization (VisSym '01), pp. 117-126, May 2001.
[37] T. Wischgoll and G. Scheuermann, "Detection and Visualization of Closed Streamlines in Planar Fields," IEEE Trans. Visualization and Computer Graphics, vol. 7, no. 2, pp. 165-172, Apr.-June 2001.
[38] T. Wischgoll and G. Scheuermann, "Locating Closed Streamlines in 3D Vector Fields," Proc. Joint Eurographics - IEEE TCVG Symp. Visualization (VisSym '02), pp. 227-280, May 2002.
[39] T. Wischgoll, G. Scheuermann, and H. Hagen, "Tracking Closed Streamlines in Time-Dependent Planar Flows," Proc.Vision Modeling and Visualization Conf. (VMV 01), pp. 447-454, Nov. 2001.
[40] E. Zhang, K. Mischaikow, and G. Turk, "Vector Field Design on Surfaces," ACM Trans. Graphics, vol. 25, no. 4, pp. 1294-1326, 2006.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool