CVGIP
2002
13 years 4 months ago
2002
Many polygon meshes have properties such as shading normals, colours, texture coordinates, and/or material attributes that are associated with the vertices, faces or corners of th...
CGF
2007
13 years 4 months ago
2007
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
CGF
2002
13 years 4 months ago
2002
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension t...
CGF
2002
13 years 4 months ago
2002
This paper presents a robust watermarking algorithm with informed detection for 3D polygonal meshes. The algorithm is based on our previous algorithm [22] that employs mesh-spectr...
CGF
2000
13 years 4 months ago
2000
We present an interactive system for the generation of high quality triangle meshes that allows us to handle hybrid geometry (point clouds, polygons, ...) as input data. In order ...
COMPUTING
2004
13 years 4 months ago
2004
Parameterization of 3D mesh data is important for many graphics and mesh processing applications, in particular for texture mapping, remeshing and morphing. Closed, manifold, genu...
CGF
2004
13 years 4 months ago
2004
We present a novel technique for retargetting captured facial animation to new facial models. We use dense motion data that can express fine motions such as wrinkles. We use a nor...
CG
2004
Springer
13 years 4 months ago
2004
Springer
In this paper we introduce a novel approach for progressive transmission of three-dimensional (3D) triangular meshes. This algorithm is based on a new reversing approach of the ir...
MCS
2007
Springer
13 years 4 months ago
2007
Springer
Mesh generation is a critical step in high fidelity computational simulations. High-quality and high-density meshes are required to accurately capture the complex physical phenome...
VC
2008
13 years 4 months ago
2008
Given a large set of unorganized point sample data, we propose a new framework for computing a triangular mesh representing an approximating piecewise smooth surface. The data may ...