skip to main content
10.1145/1810959.1810979acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
demonstration

Constructing Reeb graphs using cylinder maps

Published: 13 June 2010 Publication History

Abstract

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Arcs in the Reeb graph are computed in the second step using a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The algorithm is also able to handle non-manifold domains.

References

[1]
C. L. Bajaj, V. Pascucci, and D. R. Schikore. The contour spectrum. In Proc. IEEE Conf. Visualization, pages 167--173, 1997.
[2]
T. F. Banchoff. Critical points and curvature for embedded polyhedral surfaces. Am. Math. Monthly, 77:475--485, 1970.
[3]
K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci. Loops in Reeb graphs of 2-manifolds. Disc. Comput. Geom., 32(2):231--244, 2004.
[4]
H. Doraiswamy and V. Natarajan. Efficient output-sensitive construction of Reeb graphs. In Proc. Intl. Symp. Algorithms and Computation, pages 557--568, 2008.
[5]
H. Edelsbrunner. Geometry and Topology for Mesh Generation. Cambridge Univ. Press, England, 2001.
[6]
Y. Matsumoto. An Introduction to Morse Theory. Amer. Math. Soc., 2002. Translated from Japanese by K. Hudson and M. Saito.
[7]
G. Reeb. Sur les points singuliers d'une forme de pfaff complètement intégrable ou d'une fonction numérique. Comptes Rendus de L'Académie ses Séances, Paris, 222:847--849, 1946.
[8]
G. H. Weber, S. E. Dillard, H. Carr, V. Pascucci, and B. Hamann. Topology-controlled volume rendering. IEEE Trans. Vis. Comput. Graph., 13(2):330--341, 2007.

Cited By

View all
  • (2011)Automatic skeleton generation and character skinning2011 IEEE International Symposium on VR Innovation10.1109/ISVRI.2011.5759655(299-304)Online publication date: Mar-2011

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SoCG '10: Proceedings of the twenty-sixth annual symposium on Computational geometry
June 2010
452 pages
ISBN:9781450300162
DOI:10.1145/1810959

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Reeb graphs
  2. computational topology
  3. level set topology

Qualifiers

  • Demonstration

Conference

SoCG '10
SoCG '10: Symposium on Computational Geometry
June 13 - 16, 2010
Utah, Snowbird, USA

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2011)Automatic skeleton generation and character skinning2011 IEEE International Symposium on VR Innovation10.1109/ISVRI.2011.5759655(299-304)Online publication date: Mar-2011

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media