Constructing Laplace operator from point clouds in Rd

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 certain geometric invariants, such as manifold area, can be estimated directly from the point cloud using our PCD Laplacian with reasonable accuracy. We make the software publicly available at the authors’ web pages. Dept. of Comp. Sci. & Eng. The Ohio State University Columbus OH 43210 Comp. Sci. Dept. Stanford University Palo Alto CA 94305 Dept. of Comp. Sci. & Eng. The Ohio State University Columbus OH 43210