Relative Persistent Homology

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 Čech persistent homology can be computed as the persistent homology of the relative Čech complex C ˇ (X, A). However, 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 Čech persistent homology in low dimensional Euclidean space. We introduce the relative Delaunay–Čech complex Del C ˇ (X, A) whose homology is the relative Čech persistent homology. It is constructed from the Delaunay complex of an embedding of X in (d+ 1) -dimensional Euclidean space.

Cite

CITATION STYLE

APA

Blaser, N., & Brun, M. (2022). Relative Persistent Homology. Discrete and Computational Geometry, 68(4), 949–963. https://doi.org/10.1007/s00454-022-00421-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free