The toporrery: Computation and presentation of multiresolution topology

Mathematics and Visualization

Volumn 0, Issue , 2009, Pages 19-40

  Pascucci, Valerio ^a   Cole McLaughlin, Kree ^b,c   Scorzelli, Giorgio ^a  

^a Department of Electrical and Computer Engineering   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ORBITS; PLANETS; TREES (MATHEMATICS); USER INTERFACES;

CONNECTED COMPONENT; CONTOUR TREES; FAST EXTRACTION; ISO SURFACE; ITS APPLICATIONS; LEVEL SET; MULTIRESOLUTION; SCALAR FIELDS; TOPOLOGICAL CHANGES; USER INTERFACE COMPONENTS;

FORESTRY;

EID: 85015557262     PISSN: 16123786     EISSN: 2197666X     Source Type: Book Series    
DOI: 10.1007/b106657_2     Document Type: Conference Paper

References (26)

1. C. L. Bajaj, V. Pascucci, and D. R. Schikore. The contour spectrum. In Roni Yagel and Hans Hagen, editors, IEEE Visualization ´97, pages 167–175. IEEE, November 1997.
2. P.-T. Bremer, H. Edelsbrunner, B. Hamann, and V. Pascucci. A multi-resolution data structure for two-dimensional Morse functions. In Proceeding of IEEE Conference on Visualization, pages 139–146, October 2003.
3. H. Carr and J. Snoeyink. Path seeds and flexible isosurfaces – using topology for exploratory visualization. In Proceeding of IEEE TCVG Symposium on Visualization (Vis-Sym ’03), pages 49–58, Grenoble, Fr, May 2003.
4. H. Carr, J. Snoeyink, and U. Axen. Computing contour trees in all dimensions. In Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pages 918–926, January 2000.
5. H. Carr, J. Snoeyink, and U. Axen. Computing contour trees in all dimensions. Computational Geometry Theory and Applications, 24(2):75–94, February 2003. To appear (extended abstract appeared at SODA 2000).
6. H. Carr, J. Snoeyink, and M. van de Panne. Simplifying flexible isosurfaces using local geometric measures. In IEEE Visualization, pages 497–504, October 2004.
7. K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci. Loops in reeb graphs of 2-manifolds. In ACM Symposium on Computational Geometry, pages 344–350, July 2003.
8. K. Cole-McLaughlin and V. Pascucci. Multiresolution representation of topology. In Proceedings of the 4th IASTED International Conference on Visualization, Imaging, And Image Processing (VIIP 2004), pages 282–289, Marbella, Sapin, September 2004.
9. G. di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River, NJ, 1999.
10. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. In Proceeding of The 41st Annual Symposium on Foundations of Computer Science. IEEE, November 2000.
11. A. T. Fomenko and T. L. Kunii, editors. Topological Modeling for Visualization. Springer, Tokyo, 1997.
12. M. Hilaga, Y. Shinagawa, T. Komura, and T. L. Kunii. Topology matching for full automatic similarity estimation of 3d shapes. In Proceedings of ACMSIGGRAPH2001, pages 203–212, August 2001.
13. E. Kleiberg, H. van de Wetering, and J. J. van Wijk. Botanical visualization of huge hierarchies. In Proceedings IEEE Symposium on Information Visualization (InfoVis’2001), pages 87–94, 2001.
14. Y. Matsumoto. An Introduction to Morse Theory. AMS, 1997.
15. V. Pascucci and K. Cole-McLaughlin. Efficient computation of the topology of the level sets. In IEEE Visualization, pages 187–194, October 2002.
16. G. Reeb. Sur les points singuliers d’une forme de pfaff completement integrable ou d’une fonction numerique. Comptes Rendus Acad. Sciences Paris, 222:847–849, 1946.
17. P. J. Scott. An Application of Surface Networks in Surface Texture, chapter 11: Efficient contour tree and minimum seed set construction, pages 157–166. John Wiley & Sons, May 2004.
18. Y. Shinagawa, T. L. Kunii, H. Sato, and M. Ibusuki. Modeling the contact of two complex objects: With an application to characterizing dental articulations. Computers and Graphics, 19:21–28, 1995.
19. Y. Shinagawa and T. L. Kunii. Constructing a Reeb graph automatically from cross sections. IEEE Computer Graphics and Applications, 11:44–51, November 1991.
20. S. Takahashi, G. M. Nielson, Y. Takeshima, and I. Fujishiro. Topological volume skeletonization using adaptive tetrahedralization. In Proceeding of Geometric Modeling and Processing, pages 227–236, 2004.
21. S. Takahashi, Y. Takeshima, and I. Fujishiro. Topological volume skeletonization and its application to transfer function design. Graphical Models, 66(1):24–49, 2004.
22. A. Telea and J. J. van Wijk. Simplified representation of vector fields. In IEEE Computer Society Press, editor, Proceedings of the IEEE conference on Visualization ’99, pages 35–42, 1999.
23. X. Tricoche, G. Scheuermann, and H. Hagen. A topology simplification method for 2d vector fields. In Proceedings of the IEEE conference on Visualization, pages 359–366. IEEE Computer Society Press, 2000.
24. E. R. Tufte. Envisioning Information. Graphics Press LLC, Cheshire, CT, 1990.
25. M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D. Schikore. Contour trees and small seed sets for isosurface traversal. In Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), pages 212–220, June 1997. Extended version. Techincal report UCRL-JC-132016 Lawrence Livermore National Laboratory.
26. G. H. Weber and G. Scheuermann. Automating Transfer Function Design Based on Topology Analysis, chapter IV:5, pages 293–308. Mathematics and Visualization. Springer, Berlin, 2004.