Fast Approximation of Persistence Diagrams with Guarantees

This paper presents an algorithm for the efficient approximation of the saddle-extremum persistence diagram of a scalar field. Vidal et al. introduced recently a fast algorithm for such an approximation (by interrupting a progressive computation framework [78]). However, no theoretical guarantee was provided regarding its approximation quality. In this work, we revisit the progressive framework of...