13 search results - page 1 / 3 » Near-Optimal Connectivity Encoding of 2-Manifold Polygon Mes... |
CVGIP
2002
13 years 11 months ago
2002
PG
2000
IEEE
14 years 3 months ago
2000
IEEE
In this paper, we present a new paradigm that allows dynamically changing the topology of 2-manifold polygonal meshes. Our new paradigm always guarantees topological consistency o...
ADT
2005
13 years 11 months ago
2005
In this paper we present a new framework, based on subdivision surface approximation, for efficient compression and coding of 3D models represented by polygonal meshes. Our algorit...
CCCG
2003
14 years 17 days ago
2003
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encod...
VISUALIZATION
1999
IEEE
14 years 3 months ago
1999
IEEE
We present a method for compressing non-manifold polygonal meshes, i.e., polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygon...