Extreme elevation on a 2-manifold
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
Journal of the ACM (JACM)
Indexing through laplacian spectra
Computer Vision and Image Understanding
Efficient algorithms for computing Reeb graphs
Computational Geometry: Theory and Applications
Computing Elevation Maxima by Searching the Gauss Sphere
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
CGIM '07 Proceedings of the Ninth IASTED International Conference on Computer Graphics and Imaging
A graph-with-loop structure for a topological representation of 3D objects
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Constructing Reeb graphs using cylinder maps
Proceedings of the twenty-sixth annual symposium on Computational geometry
A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry
Algorithms and theory of computation handbook
Computing elevation maxima by searching the gauss sphere
Journal of Experimental Algorithmics (JEA)
Reeb graphs: approximation and persistence
Proceedings of the twenty-seventh annual symposium on Computational geometry
I/O-efficient contour queries on terrains
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
SkelTre - fast skeletonisation for imperfect point cloud data of botanic trees
EG 3DOR'09 Proceedings of the 2nd Eurographics conference on 3D Object Retrieval
ConTopo: non-rigid 3D object retrieval using topological information guided by conformal factors
EG 3DOR'11 Proceedings of the 4th Eurographics conference on 3D Object Retrieval
MICCAI'12 Proceedings of the 15th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
An efficient computation of handle and tunnel loops via Reeb graphs
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Technical Section: Topological saliency
Computers and Graphics
Hi-index | 0.00 |
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-manifold and the Morse function.