Sciweavers

111 search results - page 17 / 23
» Progressive Geometry Compression for Meshes
Sort
View
CGF
1999
126views more  CGF 1999»
13 years 7 months ago
A Shrink Wrapping Approach to Remeshing Polygonal Surfaces
Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms i...
Leif Kobbelt, Jens Vorsatz, Ulf Labsik, Hans-Peter...
CGF
2010
153views more  CGF 2010»
13 years 7 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton
CG
2007
Springer
13 years 7 months ago
Temporal wavelet-based compression for 3D animated models
We present an efficient compression scheme for animated sequences of triangular meshes of the same connectivity. The proposed algorithm exploits the temporal coherence of the geo...
Frédéric Payan, Marc Antonini
SIBGRAPI
2006
IEEE
14 years 1 months ago
Point set compression through BSP quantization
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
Alex Laier Bordignon, Thomas Lewiner, Hélio...
CGF
2007
98views more  CGF 2007»
13 years 7 months ago
Distance-Ranked Connectivity Compression of Triangle Meshes
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...
Patrick Marais, James E. Gain, D. Shreiner