Fast Cubical Persistent Homology on 2D and 3D Images via Union-Find, Pruning, and Lookup Tables 事件

Fast Cubical Persistent Homology on 2D and 3D Images via Union-Find, Pruning, and Lookup Tables arXiv:2606.04801v1 Announce Type: new Abstract: We present Flash Cubical, a highly efficient computation of cubical persistence on a V-filtration for 2D and 3D images over $\mathbb{F}_2$. The implementation is built around three core ideas. First, cubical complexes satisfy properties that allow for the computation of persistence of the highest dimension via union-find and duality. Second, pruning of