#### Filter Results:

#### Publication Year

1991

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We show how spectral methods may be applied to 3D mesh data to obtain compact representations. This is achieved by projecting the mesh geometry onto an orthonormal basis derived from the mesh topology. To reduce complexity, the mesh is partitioned into a number of balanced submeshes with minimal interaction, each of which are compressed independently. Our… (More)

(a) ASAP (b) ARAP (c) LABF (d) IC (e) CP Figure 1: Parameterization of the Gargoyle model using (a) our As-Similar-As-Possible (ASAP) procedure, (b) As-Rigid-As-Possible (ARAP) procedure, (c) Linear ABF [ZLS07], (d) inverse curvature approach [YKL*08], and (e) curvature prescription approach [BCGB08]. The pink lines are the seams of the closed mesh when cut… (More)

- Thabo Beeler, Fabian Hahn, Derek Bradley, Bernd Bickel, Paul A. Beardsley, Craig Gotsman +2 others
- ACM Trans. Graph.
- 2011

We present a new technique for passive and markerless facial performance capture based on <i>anchor frames</i>. Our method starts with high resolution per-frame geometry acquisition using state-of-the-art stereo reconstruction, and proceeds to establish a single triangle mesh that is propagated through the entire performance. Leveraging the fact that facial… (More)

We show how to use fixed bases for efficient spectral compression of 3D meshes. In contrast with compression using variable bases, this permits efficient decoding of the mesh. The coding procedure involves efficient mesh augmentation and generation of a neighborhood-preserving mapping between the vertices of a 3D mesh with arbitrary connectivity and those… (More)

Parameterization of 3D mesh data is important for many graphics applications, in particular for texture mapping, remeshing and morphing. Closed manifold genus-0 meshes are topologically equivalent to a sphere, hence this is the natural parameter domain for them. Parameterizing a triangle mesh onto the sphere means assigning a 3D position on the unit sphere… (More)

We describe a compression scheme for the geometry component of 3D animation sequences. This scheme is based on the principle component analysis (PCA) method, which represents the animation sequence using a small number of basis functions. Second-order linear prediction coding (LPC) is applied to the PCA coefficients in order to further reduce the code size… (More)

We describe an efficient algorithm for coding the connectivity information of general polygon meshes. In contrast to most existing algorithms which are suitable only for triangular meshes, and pay a penalty for treatment of nontriangular faces, this algorithm codes the connectivity information in a direct manner. Our treatment of the special case of… (More)

We show that the average entropy of the distribution of valences in valence sequences for the class of manifold 3D triangle meshes and the class of manifold 3D polygon meshes is strictly less than the entropy of these classes themselves. This implies that, apart from a valence sequence, another essential piece of information is needed for valence-based… (More)