DocumentCode :
3328280
Title :
Mesh collapse compression
Author :
Isenburg, Martin ; Snoeyink, Jack
Author_Institution :
North Carolina Univ., Chapel Hill, NC, USA
fYear :
1999
fDate :
1999
Firstpage :
27
Lastpage :
28
Abstract :
We present a novel algorithm for encoding the topology of triangular meshes. A sequence of edge contract and divide operations collapses the entire mesh into a single vertex. This implicitly creates a tree with weighted edges. The weights are vertex degrees and capture the topology of the unlabeled mesh. The nodes are vertices and capture the labeling of the mesh. This weighted-edge tree has a very compact encoding
Keywords :
computational geometry; trees (mathematics); algorithm; edge contract operations; edge divide operations; mesh collapse compression; tree; triangular mesh topology encoding; unlabeled mesh; vertex; vertex degrees; weighted edges; Contracts; Electrical capacitance tomography; Encoding; Internet; Labeling; Tires; Topology; Video compression;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Graphics and Image Processing, 1999. Proceedings. XII Brazilian Symposium on
Conference_Location :
Campinas
Print_ISBN :
0-7695-0481-7
Type :
conf
DOI :
10.1109/SIBGRA.1999.805604
Filename :
805604
Link To Document :
بازگشت