An approximation to Čech complex using median of triangles for computing Betti numbers of some point cloud data
1 Department of Mathematics, University of Rajshahi, Rajshahi-6205, Bangladesh.
2 Department of Mathematics, Rajshahi University of Engineering and Technology, Rajshahi-6204, Bangladesh.
Research Article
World Journal of Advanced Engineering Technology and Sciences, 2023, 09(02), 037–048.
Article DOI: 10.30574/wjaets.2023.9.2.0201
Publication history:
Received on 31 May 2023; revised on 07 July 2023; accepted on 10 July 2023
Abstract:
An approach has been developed to create an approximated simplicial complex in between the Vietoris-Rips complex and the Čech complex using median of triangles for computing Betti numbers of some point cloud data. The Vietoris-Rips complex has been built first for this. Then the sample points have been classified into three classes based on three conditions of the median ( l ) of any triangle’s maximum edge (2r) for any three points in Rn. Then the values of the filtration (ε) have been chosen in such a way that ε = r for l < r, ε = r for l = r, and ε = r + (l - r)/3 for l > r. The approach has been extended for higher dimensional triangles calculating l by the distance of the centroid from the opposite vertex of the maximum face and considering r as the filtration value of the maximum edge. Then an algorithm has been introduced to calculate the simplicial complex after building simplices for each filtration value. Finally, to validate the study results of the approximated simplicial complex have been compared with the Vietoris-Rips complex and the Čech complex. The proposed approximated simplicial complex has been found computationally effective than the Čech complex and its filtration values are lying between filtration values of the Vietoris-Rips complex and the Čech complex without any loss of persistent data.
Keywords:
Approximated simplicial complex; Čech complex; Vietoris–Rips complex; Persistent homology; Topological data analysis; Point cloud data; Betti numbers.
Full text article in PDF:
Copyright information:
Copyright © 2023 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0