
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
BongSoo Sohn, Chandrajit Bajaj, "TimeVarying Contour Topology," IEEE Transactions on Visualization and Computer Graphics, vol. 12, no. 1, pp. 1425, January/February, 2006.  
BibTex  x  
@article{ 10.1109/TVCG.2006.16, author = {BongSoo Sohn and Chandrajit Bajaj}, title = {TimeVarying Contour Topology}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {12}, number = {1}, issn = {10772626}, year = {2006}, pages = {1425}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2006.16}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  TimeVarying Contour Topology IS  1 SN  10772626 SP14 EP25 EPD  1425 A1  BongSoo Sohn, A1  Chandrajit Bajaj, PY  2006 KW  Contour tree KW  level set topology KW  feature tracking KW  timevarying volume visualization. VL  12 JA  IEEE Transactions on Visualization and Computer Graphics ER   
Abstract—The contour tree has been used to compute the topology of isosurfaces, generate a minimal seed set for accelerated isosurface extraction, and provide a user interface to segment individual contour components in a scalar field. In this paper, we extend the benefits of the contour tree to timevarying data visualization. We define temporal correspondence of contour components and describe an algorithm to compute the correspondence information in timedependent contour trees. A graph representing the topology changes of timevarying isosurfaces is constructed in realtime for any selected isovalue using the precomputed correspondence information. Quantitative properties, such as surface area and volume of contour components, are computed and labeled on the graph. This topology change graph helps users to detect significant topological and geometric changes in timevarying isosurfaces. The graph is also used as an interactive user interface to segment, track, and visualize the evolution of any selected contour components over time.
[1] C.L. Bajaj, V. Pascucci, and D.R. Schikore, “Fast Isocontouring for Improved Interactivity,” Proc. 1996 Symp. Volume Visualization, pp. 3946, 1996.
[2] C.L. Bajaj, V. Pascucci, and D.R. Schikore, “The Contour Spectrum,” Proc. IEEE Visualization Conf., pp. 167173, 1997.
[3] P. Bhaniramka, R. Wenger, and R. Crawfis, “Isosurfacing in Higher Dimensions,” Proc. IEEE Visualization 2000, pp. 267274, 2000.
[4] H. Carr, T. Möller, and J. Snoeyink, “Simplicial Subdivisions and Sampling Artifacts,” Proc. IEEE Visualization Conf., pp. 99108, 2001.
[5] H. Carr and J. Snoeyink, “Path Seeds and Flexible Isosurfaces Using Topology for Exploratory Visualization,” Proc. IEEE TCVG Symp. Visualization (VisSym), pp. 4958, 2003.
[6] H. Carr, J. Snoeyink, and U. Axen, “Computing Contour Trees in All Dimensions,” Computational Geometry: Theory and Applications, vol. 24, no. 2, pp. 7594, 2003.
[7] Y.J. Chiang, “OutofCore Isosurface Extraction of TimeVarying Fields over Irregular Grids,” Proc. IEEE Visualization Conf., pp. 217224, 2003.
[8] Y.J. Chiang, T. Lenz, X. Lu, and G. Rote, “Simple and Optimal OutputSensitive Construction of Contour Trees Using Monotone Paths,” Computational Geometry: Theory and Applications, vol. 30, no. 2, pp. 165196, 2003.
[9] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. Cambridge, Mass.: MIT Press, 1990.
[10] H. Edelsbrunner, J. Harer, A. Mascarenhas, and V. Pascucci, “TimeVarying Reeb Graphs for Continuous SpaceTime Data,” Proc. ACM Symp. Computational Geometry, pp. 366372, 2004.
[11] Website for TimeVarying Contour Topology, 2005, http://www.ices.utexas.edu/~bongbongtime_analysis .
[12] D. Goodsell, “Hemoglobin: Cooperation Makes It Easier,” http://www.scripps.edu/pub/goodsell/pdb/ pdb41pdb41_2.html, 2005.
[13] G. Ji and H.W. Shen, “Efficient Isosurface Tracking Using Precomputed Correspondence Table,” Proc. EurographicsIEEE TCVG Symp. Visualization, pp. 283292, 2004.
[14] G. Ji, H.W. Shen, and R. Wenger, “Volume Tracking Using Higher Dimensional Isocontouring,” Proc. IEEE Visualization Conf., pp. 209216, 2003.
[15] L. Kettner, J. Rossignac, and J. Snoeyink, “The Safari Interface for Visualizing TimeDependent Volume Data Using IsoSurfaces and Contour Spectra,” Computational Geometry: Theory and Applications, vol. 25, nos. 12, pp. 97116, 2003.
[16] W.S. Koegler, “Case Study: Application of Feature Tracking to Analysis of Autoignition Simulation Data,” Proc. IEEE Visualization Conf., pp. 461464, 2001.
[17] V. Pascucci, “On the Topology of the Level Sets of a Scalar Field,” Proc. 12th Canadian Conf. Computational Geometry, pp. 141144, 2001.
[18] V. Pascucci and K. ColeMcLaughlin, “Efficient Computation of the Topology of Level Sets,” Proc. IEEE Visualization Conf., pp. 187194, 2002.
[19] R. Samtaney, D. Silver, N. Zabusky, and J. Cao, “Visualizing Features and Tracking Their Evolution,” Computer, pp. 2027, July 1994.
[20] H.W. Shen, “Isosurface Extraction in TimeVarying Fields Using a Temporal Hierarchical Index Tree,” Proc. IEEE Visualization Conf., pp. 159166, 1998.
[21] D. Silver and X. Wang, “Tracking and Visualization Turbulent 3D Features,” IEEE Trans. Visualization and Computer Graphics, vol. 3, no. 2, pp. 129141, Apr.June 1997.
[22] D. Silver and X. Wang, “Tracking Scalar Features in Unstructured Datasets,” Proc. IEEE Visualization Conf., pp. 7986, 1998.
[23] J.K. Sircar and J.A. Cerbrian, “Application of Image Processing Techniques to the Automated Labelling of Raster Digitized Contours,” Proc. Int'l Symp. Spatial Data Handling, pp. 171184, 1986.
[24] P.M. Sutton and C.D. Hansen, “Isosurface Extraction in TimeVarying Fields Using a Temporal BranchonNeed Tree (TBON),” Proc. IEEE Visualization Conf., pp. 147154, 1999.
[25] S. Takahashi, T. Ikeda, Y. Shinagawa, T.L. Kunii, and M. Ueda, “Algorithms for Extracting Correct Critical Points and Constructing Topological Graphs from Discrete Geographical Elevation Data,” Computer Graphics Forum, vol. 14, no. 3, pp. 181192, 1995.
[26] S.P. Tarasov and M.N. Vyalyi, “Construction of Contour Trees in 3D in $O(N\log N)$ Steps,” Proc. ACM Symp. Computational Geometry, pp. 6875, 1998.
[27] M.J. van Kreveld, R. van Oostrum, C.L. Bajaj, V. Pascucci, and D. Schikore, “Contour Trees and Small Seed Sets for Isosurface Traversal,” Proc. ACM Symp. Computational Geometry, pp. 212220, 1997.
[28] C. Weigle and D.C. Banks, “Extracting IsoValued Features in 4Dimensional Scalar Fields,” Proc. IEEE Symp. Volume Visualization, pp. 103110, 1998.