A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Shape Analysis Using the Edge-Based Laplacian
[chapter]
2012
Lecture Notes in Computer Science
This paper presents a novel analysis and application of the eigensystem of the edge-based Laplacian of a graph. The advantage of using the edge-based Laplacian over its vertex-based counterpart is that it significantly expands the set of differential operators that can be implemented in the graph domain. We commence by presenting a new mesh characterization based on the adjacency matrix of the mesh that captures both the geometric and topological properties of the shape. We use the edge-based
doi:10.1007/978-3-642-34166-3_42
fatcat:xzv7e634znav3blzpovxrktw6m