Scalar Field Analysis over Point Cloud Data

Frédéric Chazal 1, * Leonidas J. Guibas 2 Steve Oudot 1 Primoz Skraba 1
* Auteur correspondant
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : Given a real-valued function f defined over some metric space 핏 , is it possible to recover some structural information about f from the sole information of its values at a finite set L⊆핏 of sample points, whose locations are only known through their pairwise distances in 핏 ? We provide a positive answer to this question. More precisely, taking advantage of recent advances on the front of stability for persistence diagrams, we introduce a novel algebraic construction, based on a pair of nested families of simplicial complexes built on top of the point cloud L, from which the persistence diagram of f can be faithfully approximated. We derive from this construction a series of algorithms for the analysis of scalar fields from point cloud data. These algorithms are simple and easy to implement, they have reasonable complexities, and they come with theoretical guarantees. To illustrate the genericity and practicality of the approach, we also present some experimental results obtained in various applications, ranging from clustering to sensor networks.
Type de document :
Article dans une revue
Discrete and Computational Geometry, Springer Verlag, 2011, 46 (4), pp.743-775. 〈〉. 〈10.1007/s00454-011-9360-x〉
Liste complète des métadonnées
Contributeur : Marc Glisse <>
Soumis le : jeudi 10 janvier 2013 - 14:57:29
Dernière modification le : vendredi 12 janvier 2018 - 11:01:51




Frédéric Chazal, Leonidas J. Guibas, Steve Oudot, Primoz Skraba. Scalar Field Analysis over Point Cloud Data. Discrete and Computational Geometry, Springer Verlag, 2011, 46 (4), pp.743-775. 〈〉. 〈10.1007/s00454-011-9360-x〉. 〈hal-00772430〉



Consultations de la notice