2004
DOI: 10.1007/s00454-004-1122-6
View full text
|
|
Share

Abstract: Given a Morse function f over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight upper and lower bounds on the number of loops in the Reeb graph that depend on the genus, the number of boundary components, and whether or not the 2-manifold is orientable. We also give an algorithm that constructs the Reeb graph in time O(n log n), where n is the number of edges in the triangulation used to represent the 2-manifol…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
50
0
2

Publication Types

Select...

Relationship

0
0

Authors

Journals