Controlled simplification of genus for polygonal models
VIS '97 Proceedings of the 8th conference on Visualization '97
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
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
Simplification and Repair of Polygonal Models Using Volumetric Techniques
IEEE Transactions on Visualization and Computer Graphics
GRIN'01 No description on Graphics interface 2001
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Fair morse functions for extracting the topological structure of a surface mesh
ACM SIGGRAPH 2004 Papers
Discrete & Computational Geometry
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
Tightening non-simple paths and cycles on surfaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Vines and vineyards by updating persistence in linear time
Proceedings of the twenty-second annual symposium on Computational geometry
Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics)
Topology Repair of Solid Models Using Skeletons
IEEE Transactions on Visualization and Computer Graphics
SMI '07 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007
Robust on-line computation of Reeb graphs: simplicity and speed
ACM SIGGRAPH 2007 papers
Defining and computing curve-skeletons with medial geodesic function
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Computing shortest cycles using universal covering space
The Visual Computer: International Journal of Computer Graphics
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
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Technical Section: Geometry-aware domain decomposition for T-spline-based manifold modeling
Computers and Graphics
Abstraction of 2D shapes in terms of parts
Proceedings of the 7th International Symposium on Non-Photorealistic Animation and Rendering
Computing handle and tunnel loops with knot linking
Computer-Aided Design
Optimal homologous cycles, total unimodularity, and linear programming
Proceedings of the forty-second ACM symposium on Theory of computing
Hardness results for homology localization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Technical Section: Tiling surfaces with cylinders using n-loops
Computers and Graphics
Invariant representative cocycles of cohomology generators using irregular graph pyramids
Computer Vision and Image Understanding
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Computing shortest words via shortest loops on hyperbolic surfaces
Computer-Aided Design
An iterative algorithm for homology computation on simplicial shapes
Computer-Aided Design
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
SIAM Journal on Computing
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
SMI 2012: Full Spectral computations on nontrivial line bundles
Computers and Graphics
An efficient computation of handle and tunnel loops via Reeb graphs
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Efficiently hex-meshing things with topology
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Many applications such as topology repair, model editing, surface parameterization, and feature recognition benefit from computing loops on surfaces that wrap around their 'handles' and 'tunnels'. Computing such loops while optimizing their geometric lengths is difficult. On the other hand, computing such loops without considering geometry is easy but may not be very useful. In this paper we strike a balance by computing topologically correct loops that are also geometrically relevant. Our algorithm is a novel application of the concepts from topological persistence introduced recently in computational topology. The usability of the computed loops is demonstrated with some examples in feature identification and topology simplification.