DocumentCode
3113631
Title
A compression framework for triangulated 3-D meshes
Author
Sheker, C. ; Gupta, Swastik
Author_Institution
Dept. of Electr. Eng., Indian Inst. of Technol. Kanpur, Kanpur, India
fYear
2013
fDate
13-15 Dec. 2013
Firstpage
1
Lastpage
5
Abstract
In 3-D animations and graphics, triangulated meshes play an important role to build 3-D surfaces of simple objects as well as complex objects. Generally meshes require a huge amount of data for storage and transmission. Consequently, compression of 3-D meshes. In this paper geometry and connectivity data are compressed seperately. Although connectivity data is compressed independently, the geometry compression uses connectivity data. For geometry data, we propose a compression technique using projection and connectivity guided prediction. The 3D mesh is transformed into two 2D images and standard image processing techniques are applied to obtain compression. We used JPEG coding for compression of images. For connectivity data, we present a new compression algorithm, based on the idea of making strips. The algorithm first encodes the Connectivity information of mesh into a output text file which is half in size compared to the original mesh size. This is done by using recursion and stack operations. These text files can be further compressed into rar file or strip file resulting in faster transmission and rendering of complex graphical objects.
Keywords
computer animation; data compression; image coding; mesh generation; 3D animations; 3D graphics; JPEG coding; compression framework; data storage; data transmission; geometry compression; image compression; triangulated 3D meshes; Geometry; Image coding; Image reconstruction; Indexes; Lattices; Three-dimensional displays; Transform coding;
fLanguage
English
Publisher
ieee
Conference_Titel
India Conference (INDICON), 2013 Annual IEEE
Conference_Location
Mumbai
Print_ISBN
978-1-4799-2274-1
Type
conf
DOI
10.1109/INDCON.2013.6726135
Filename
6726135
Link To Document