Fast Approximation of Persistence Diagrams with Guarantees
2021 IEEE 11th Symposium on Large Data Analysis and Visualization (LDAV)(2021)
Abstract
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...
MoreTranslated text
Key words
persistence diagrams,guarantees
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined