A signal processing approach to fair surface design
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Implicit fairing of irregular meshes using diffusion and curvature flow
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Projective clustering in high dimensions using core-sets
Proceedings of the eighteenth annual symposium on Computational geometry
Shape dimension and intrinsic metric from samples of manifolds with high co-dimension
Proceedings of the nineteenth annual symposium on Computational geometry
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Discrete Laplace-Beltrami operators and their convergence
Computer Aided Geometric Design - Special issue: Geometric modeling and processing 2004
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Convergence analysis of a discretization scheme for Gaussian curvature over triangular surfaces
Computer Aided Geometric Design
Manifold reconstruction in arbitrary dimensions using witness complexes
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Laplace-Beltrami eigenfunctions for deformation invariant shape representation
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Finding the Homology of Submanifolds with High Confidence from Random Samples
Discrete & Computational Geometry
Discrete laplace operator on meshed surfaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
Laplace-Beltrami spectra as 'Shape-DNA' of surfaces and solids
Computer-Aided Design
Global intrinsic symmetries of shapes
SGP '08 Proceedings of the Symposium on Geometry Processing
Towards a theoretical foundation for laplacian-based manifold methods
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Convergence analysis of discrete differential geometry operators over surfaces
IMA'05 Proceedings of the 11th IMA international conference on Mathematics of Surfaces
Integral estimation from point cloud in d-dimensional space: a geometric view
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximating gradients for meshes and point clouds via diffusion metric
SGP '09 Proceedings of the Symposium on Geometry Processing
International Journal of Computer Vision
Spectral sampling of manifolds
ACM SIGGRAPH Asia 2010 papers
Shape comparison through mutual distances of real functions
Proceedings of the ACM workshop on 3D object retrieval
Shape google: Geometric words and expressions for invariant shape retrieval
ACM Transactions on Graphics (TOG)
SMI 2011: Full Paper: Point set silhouettes via local reconstruction
Computers and Graphics
SMI 2011: Full Paper: Harmonic point cloud orientation
Computers and Graphics
Graph-based representations of point clouds
Graphical Models
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
Photometric heat kernel signatures
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Computer Graphics Forum
Nonrigid Matching of Undersampled Shapes via Medial Diffusion
Computer Graphics Forum
Affine-invariant photometric heat kernel signatures
EG 3DOR'12 Proceedings of the 5th Eurographics conference on 3D Object Retrieval
Articulated motion segmentation of point clouds by group-valued regularization
EG 3DOR'12 Proceedings of the 5th Eurographics conference on 3D Object Retrieval
Geodesics in heat: A new approach to computing distance based on heat flow
ACM Transactions on Graphics (TOG)
Hi-index | 0.00 |
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.