Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Seamster: inconspicuous low-distortion texture seam layout
Proceedings of the conference on Visualization '02
GRIN'01 No description on Graphics interface 2001
Global conformal surface parameterization
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Loops in Reeb Graphs of 2-Manifolds
Discrete & Computational Geometry
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tightening non-simple paths and cycles on surfaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Topology Repair of Solid Models Using Skeletons
IEEE Transactions on Visualization and Computer Graphics
Robust on-line computation of Reeb graphs: simplicity and speed
ACM SIGGRAPH 2007 papers
On Computing Handle and Tunnel Loops
CW '07 Proceedings of the 2007 International Conference on Cyberworlds
Reeb graphs for shape analysis and applications
Theoretical Computer Science
Computing geometry-aware handle and tunnel loops in 3D models
ACM SIGGRAPH 2008 papers
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
Computational Geometry: Theory and Applications
Topology for Computing
Computer Graphics in Italy: Computational methods for understanding 3D shapes
Computers and Graphics
From geometric to semantic human body models
Computers and Graphics
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Computer-Aided Design
| Hi-index | 0.00 |
Loops in surfaces associated with topological features such as handles and tunnels are important entities in many applications including surface parameterization, feature identification, and topological simplification. Recently, a persistent homology based algorithm has been proposed to compute them. The algorithm has several advantages including its simplicity, combinatorial nature and independence from computing other extra structures. In this paper, we propose changes to this loop computation algorithm based on some novel observations. These changes reduce the computation time of the algorithm dramatically. In particular, our experimental results show that the suggested changes achieve considerable speed up for large data sets without sacrificing loop qualities.