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 -approximating the topological information of the v{C}ech complexes for points in , for . Our approximation has a total size of for constant dimension , improving all the currently available -approximation schemes of simplicial filtrations in Euclidean space. Perhaps counter-intuitively, we arrive at our result by adding additional 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.
Recommendations
Cited in
(10)- Topological grammars for data approximation
- Compression for \(2\)-parameter persistent homology
- Improved approximate Rips filtrations with shifted integer lattices and cubical complexes
- Sparse Dowker nerves
- Approximating persistent homology in Euclidean space through collapses
- Improved Scale-Invariant Moments for Deformation Digits
- Topological inference via meshing
- Universality of the homotopy interleaving distance
- Sparse higher order Čech filtrations
- A sparse Delaunay filtration
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)