The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
GRIN'01 No description on Graphics interface 2001
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Vines and vineyards by updating persistence in linear time
Proceedings of the twenty-second annual symposium on Computational geometry
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
SMI '07 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007
On Computing Handle and Tunnel Loops
CW '07 Proceedings of the 2007 International Conference on Cyberworlds
Finding the Homology of Submanifolds with High Confidence from Random Samples
Discrete & Computational Geometry
Computing geometry-aware handle and tunnel loops in 3D models
ACM SIGGRAPH 2008 papers
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Measuring and computing natural generators for homology groups
Computational Geometry: Theory and Applications
Greedy routing with guaranteed delivery using Ricci flows
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Approximating loops in a shortest homology basis from point data
Proceedings of the twenty-sixth annual symposium on Computational geometry
Invariant representative cocycles of cohomology generators using irregular graph pyramids
Computer Vision and Image Understanding
The least spanning area of a knot and the optimal bounding chain problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
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
| Hi-index | 0.00 |
We address the problem of localizing homology classes, namely, finding the cycle representing a given class with the most concise geometric measure. We focus on the volume measure, that is, the 1-norm of a cycle. Two main results are presented. First, we prove the problem is NP-hard to approximate within any constant factor. Second, we prove that for homology of dimension two or higher, the problem is NP-hard to approximate even when the Betti number is O(1). A side effect is the inapproximability of the problem of computing the nonbounding cycle with the smallest volume, and computing cycles representing a homology basis with the minimal total volume. We also discuss other geometric measures (diameter and radius) and show their disadvantages in homology localization. Our work is restricted to homology over the Z2 field.