Improved topological approximations by digitization

From MaRDI portal



Abstract: v{C}ech complexes are useful simplicial complexes for computing and analyzing topological features of data that lies in Euclidean space. Unfortunately, computing these complexes becomes prohibitively expensive for large-sized data sets even for medium-to-low dimensional data. We present an approximation scheme for (1+epsilon)-approximating the topological information of the v{C}ech complexes for n points in mathbbRd, for epsilonin(0,1]. Our approximation has a total size of nleft(frac1epsilonight)O(d) for constant dimension d, improving all the currently available (1+epsilon)-approximation schemes of simplicial filtrations in Euclidean space. Perhaps counter-intuitively, we arrive at our result by adding additional nleft(frac1epsilonight)O(d) sample points to the input. We achieve a bound that is independent of the spread of the point set by pre-identifying the scales at which the v{C}ech complexes changes and sampling accordingly.












This page was built for publication: Improved topological approximations by digitization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236356)