Constructing Laplace operator from point clouds in R.d
Lists
Only you see this
Abstract
We present an algorithm for approximating the Laplace-Beltrami operator from an arbitrary point cloud obtained from a k-dimensional manifold embedded in the d-dimensional space. We show that this PCD Laplace (Point-Cloud Data Laplace) operator converges to the Laplace-Beltrami operator on the underlying manifold as the point cloud becomes denser. Unlike the previous work, we do not assume that the data samples are independent identically distributed from a probability distribution and do not require a global mesh. The resulting algorithm is easy to implement. We present experimental results indicating that even for point sets sampled from a uniform distribution, PCD Laplace converges faster than the weighted graph Laplacian. We also show that using our PCD Laplacian we can directly estimate certain geometric invariants, such as manifold area.
BibTeX
@inproceedings{belkin2009constructing,
author = {Mikhail Belkin and Jian Sun and Yusu Wang},
title = {{Constructing Laplace operator from point clouds in R.d}},
booktitle = {SODA},
year = {2009},
doi = {10.1137/1.9781611973068.112},
}Loading related content...