Computational complexity of combinatorial surfaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Encyclopedic dictionary of mathematics (2nd ed.)
Encyclopedic dictionary of mathematics (2nd ed.)
Generic programming and the STL: using and extending the C++ Standard Template Library
Generic programming and the STL: using and extending the C++ Standard Template Library
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Multidimensional binary search trees used for associative searching
Communications of the ACM
Computing a canonical polygonal schema of an orientable triangulated surface
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Optimally cutting a surface into a disk
Proceedings of the eighteenth annual symposium on Computational geometry
GRIN'01 No description on Graphics interface 2001
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Discrete & Computational Geometry
Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics)
Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics)
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the Local Behavior of Spaces of Natural Images
International Journal of Computer Vision
Advanced Homology Computation of Digital Volumes Via Cell Complexes
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Cell AT-Models for Digital Volumes
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
The tidy set: a minimal simplicial set for computing homology of clique complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry
Algorithms and theory of computation handbook
An iterative algorithm for homology computation on simplicial shapes
Computer-Aided Design
Technical Section: Topological saliency
Computers and Graphics
| Hi-index | 0.00 |
In this paper, we provide the theoretical foundation and an effective algorithm for localizing topological attributes such as tunnels and voids. Unlike previous work that focused on 2-manifolds with restricted geometry, our theory is general and localizes arbitrary-dimensional attributes in arbitrary spaces. We implement our algorithm to validate our approach in practice.