DocumentCode :
2021179
Title :
Connectivity compression for three-dimensional planar triangle meshes
Author :
Kubola, Kanuengnij ; Chu, Henry
Author_Institution :
Center for Adv. Comput. Studies, The Univ. of Louisiana at Lafayette, LA, USA
fYear :
2005
fDate :
6-8 July 2005
Firstpage :
837
Lastpage :
841
Abstract :
We describe a new algorithm for coding the connectivity information of three-dimensional planar triangle meshes. Vertices of a mesh are placed on a two-dimensional grid. The connectivity pattern of the grid is implicit and hence the only information that needs to be encoded is the diagonal links. We present experimental results that show that the new method has a low connectivity cost of 2.1 bits per vertex on average.
Keywords :
data compression; mesh generation; 3D planar triangle meshes; connectivity compression; connectivity pattern; Computer displays; Costs; Encoding; Graphics; Hardware; Layout; Rendering (computer graphics); Surveillance; Telemedicine; Three dimensional displays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Visualisation, 2005. Proceedings. Ninth International Conference on
ISSN :
1550-6037
Print_ISBN :
0-7695-2397-8
Type :
conf
DOI :
10.1109/IV.2005.37
Filename :
1509169
Link To Document :
بازگشت