30 search results - page 5 / 6 » An Efficient Connectivity Compression for Triangular Meshes |
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we present a new framework to analyse and process 3D animations (defined by sequences of triangular meshes sharing the same connectivity at any frame). Our idea is...
TOG
2002
13 years 7 months ago
2002
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
PAMI
2007
13 years 6 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
ADT
2005
13 years 7 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...
SMI
2003
IEEE
14 years 20 days ago
2003
IEEE
A lot of techniques have been developed for the encoding of triangular meshes as this is a widely used representation for the description of surface models. Although methods for t...