Skip to Main content Skip to Navigation
Conference papers

Persistence-sensitive simplication of functions on surfaces in linear time

Abstract : Persistence provides a way of grading the importance of homological features in the sublevel sets of a real-valued function. Following the definition given by Edelsbrunner, Morozov and Pascucci, an ε-simplication of a function f is a function g in which the homological noise of persistence less than ε has been removed. In this paper, we give an algorithm for constructing an ε-simplication of a function defined on a triangulated surface in linear time. Our algorithm is very simple, easy to implement and follows directly from the study of the ε-simplication of a function on a tree. We also show that the computation of persistence defined on a graph can be performed in linear time in a RAM model. This gives an overall algorithm in linear time for both computing and simplifying the homological noise of a function f on a surface.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download


https://hal.inria.fr/hal-02293165
Contributor : Marc Glisse <>
Submitted on : Friday, September 20, 2019 - 3:55:34 PM
Last modification on : Thursday, November 19, 2020 - 1:01:06 PM
Long-term archiving on: : Sunday, February 9, 2020 - 4:37:27 AM

Files

aghlm-pdssf-09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02293165, version 1

Collections

Citation

Dominique Attali, Marc Glisse, Samuel Hornus, Francis Lazarus, Dmitriy Morozov. Persistence-sensitive simplication of functions on surfaces in linear time. TopoInVis'09, 2009, Salt Lake City, United States. ⟨hal-02293165⟩

Share

Metrics

Record views

75

Files downloads

487