Show simple item record

dc.contributor.authorEdelsbrunner, Herberten_US
dc.date.accessioned2015-02-21T14:30:21Z
dc.date.available2015-02-21T14:30:21Z
dc.date.issued2006en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/j.1467-8659.2006.00942.xen_US
dc.description.abstractThe idea of topological persistence is to look at homological features that persist along a nested sequence of topo-logical spaces. As a typical example, we may take the sequence of sublevel sets of a function. The combinatorial characterization of persistence in terms of pairs of critical values and fast algorithms computing these pairs make this idea practical and useful in dealing with the pervasive phenomenon of noise in geometric and visual data. This talk will1. recall the relatively short history of persistence and some of its older roots;2. introduce the concept intuitively while pointing out where algebra is needed to solidify the more difficult steps;3. discuss a few applications to give a feeling of the potential of the method in dealing with noise and scale.Besides the initial concept, the talk will touch upon recent extensions and their motivation.en_US
dc.publisherThe Eurographics Association and Blackwell Publishing, Incen_US
dc.titleA Primer on Topological Persistenceen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume25en_US
dc.description.number3en_US
dc.identifier.doi10.1111/j.1467-8659.2006.00942.xen_US
dc.identifier.pagesxvii-xviien_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record