2025/02/06 by Nkechi Nnadi, Daniel C. Isaksen, Nnadi, Nkechi +1 · 1 citation
Computer Science · #Algebraic Topology (math.AT) #Computational Geometry (cs.CG) #Digital Image Processing Techniques #FOS: Computer and information sciences #FOS: Mathematics #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2502.03744
openalex publication_date 2025/02/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Many practical applications in topological data analysis arise from data in the form of point clouds, which then yield simplicial complexes. The combinatorial structure of simplicial complexes captures the topological relationships between the elements of the complex. In addition to the combinatorial structure, simplicial complexes possess a geometric realization that provides a concrete way to visualize the complex and understand its geometric properties. This work presents an amended Hausdorff distance as an extended metric that integrates geometric proximity with the topological features of simplicial complexes. We also present a version of the simplicial Hausdorff metric for filtered complexes and show results on its computational complexity. In addition, we discuss concerns about the monotonicity of the measurement functions involved in the setup of the simplicial complexes.