Computer Science – Computational Geometry
Scientific paper
2007-05-21
Computer Science
Computational Geometry
References 8 and 22 are fixed
Scientific paper
We develop a method for measuring and localizing homology classes. This involves two problems. First, we define relevant notions of size for both a homology class and a homology group basis, using ideas from relative homology. Second, we propose an algorithm to compute the optimal homology basis, using techniques from persistent homology and finite field algebra. Classes of the computed optimal basis are localized with cycles conveying their sizes. The algorithm runs in $O(\beta^4 n^3 \log^2 n)$ time, where $n$ is the size of the simplicial complex and $\beta$ is the Betti number of the homology group.
Chen Chao
Freedman Daniel
No associations
LandOfFree
Measuring and Localing Homology Classes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Measuring and Localing Homology Classes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Measuring and Localing Homology Classes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-415260