arXiv:2607. 27126v1 Announce Type: new Abstract: Persistence Diagram (PD) is known to capture point cloud topology effectively, but its computation has high time complexity.
By Kaifeng Zhang, Kai Ming Ting
arXiv:2606. 11911v1 Announce Type: cross Abstract: Persistence diagrams are common representations in topological data analysis, but they do not naturally live in a vector space, and the statistical tools developed for comparing them have largely evolved separately from those used for downstream prediction.
By Juliette Murris, Bernadette Stolz, Karsten Borgwardt
arXiv:2507. 07156v2 Announce Type: replace-cross Abstract: Supervised machine learning pipelines trained on features derived from persistent homology have been experimentally observed to ignore much of the information contained in a persistence diagram.
By Nicole Abreu, Parker B. Edwards, Francis Motta
arXiv:2505. 04346v2 Announce Type: replace Abstract: Clustering aims at partitioning data points into groups of similar objects without knowing about the class labels.
By Arghya Pratihar, Kushal Bose, Swagatam Das
arXiv:2608. 06276v1 Announce Type: cross Abstract: Persistence diagrams (PDs) provide stable and interpretable summaries of multiscale topological structure.
By Farzana Nasrin
The paper introduces VAD, a lightweight, network‑free method for computing Unsigned Distance Fields (UDFs) from unoriented point clouds. It assigns bi‑directional normals using two Voronoi‑based criteria, diffuses these normals to approximate a UDF gradient field, and then integrates to recover the final UDF. Experiments show VAD handles watertight, open, non‑manifold, and non‑orientable geometries efficiently and stably.
By Jiayi Kong, Chen Zong, Junkai Deng, Xuhui Chen, Fei Hou, Shiqing Xin, Junhui Hou, Chen Qian, Ying He