Relative Persistent Homology
Journal article, Peer reviewed
MetadataShow full item record
Original versionLeibniz International Proceedings in Informatics. 2020, 164, 18, 1-10. 10.4230/LIPIcs.SoCG.2020.18
The alpha complex efficiently computes persistent homology of a point cloud X in Euclidean space when the dimension d is low. Given a subset A of X, relative persistent homology can be computed as the persistent homology of the relative Čech complex Č(X, A). But this is not computationally feasible for larger point clouds X. The aim of this note is to present a method for efficient computation of relative persistent homology in low dimensional Euclidean space. We introduce the relative Delaunay-Čech complex DelČ(X, A) whose homology is the relative persistent homology. It is constructed from the Delaunay complex of an embedding of X in (d+1)-dimensional Euclidean space.