Approximating Loops in a Shortest Homology Basis from Point Data

Details Approximating Loops in a Shortest Homology Basis from Point Data Approximating Loops in a Shortest Homology Basis from Point Data

2009-09-30

arxiv.org/abs/0909.5654v2

Computer Science

Computational Geometry

Scientific paper

Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering applications. In this paper we present an algorithm to compute a set of loops from a point data that presumably sample a smooth manifold $M\subset \mathbb{R}^d$. These loops approximate a {\em shortest} basis of the one dimensional homology group $H_1(M)$ over coefficients in finite field $\mathbb{Z}_2$. Previous results addressed the issue of computing the rank of the homology groups from point data, but there is no result on approximating the shortest basis of a manifold from its point sample. In arriving our result, we also present a polynomial time algorithm for computing a shortest basis of $H_1(K)$ for any finite {\em simplicial complex} $K$ whose edges have non-negative weights.

Affiliated with

Also associated with

No associations

Rating

Approximating Loops in a Shortest Homology Basis from Point Data 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 Approximating Loops in a Shortest Homology Basis from Point Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating Loops in a Shortest Homology Basis from Point Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-590350