This paper presents a comprehensive review and analysis of recent spectral shape
descriptors for nonrigid 3D shape retrieval. More specifically, we compare the latest spectral …

This paper proposes the use of the surface-based Laplace–Beltrami and the volumetric
Laplace eigenvalues and eigenfunctions as shape descriptors for the comparison and …

We propose a metric for Reeb graphs, called the functional distortion distance. Under this
distance, the Reeb graph is stable against small changes of input functions. At the same …

Scalar functions defined on manifold triangle meshes is a starting point for many geometry
processing algorithms such as mesh parametrization, skeletonization, and segmentation. In …

This work introduces a method to hierarchically segment articulated shapes into meaningful
parts and to register these parts across populations of near-isometric shapes (eg head …

Cutting-Edge Techniques to Better Analyze and Predict Complex Physical Phenomena
Geometric Modeling and Mesh Generation from Scanned Images shows how to integrate …

Work practices vary among software developers. Some are highly focused on a few artifacts;
others make wideranging contributions. Similarly, some artifacts are mostly authored, or …

We present a deterministic algorithm to compute the Reeb graph of a PL real-valued
function on a simplicial complex in O (m log m) time, where m is the size of the 2-skeleton …

In this work, we introduce a numerical method to approximate differential operators and
integrals on point clouds sampled from a two dimensional manifold embedded in Rn. Global …

Given a continuous scalar field ƒ: X→ where X is a topological space, a level set of ƒ is a set
{x∈ X: ƒ (x)= α} for some value α∈ IR. The level sets of ƒ can be subdivided into connected …