Premium
Triangle Strip Compression
Author(s) -
Isenburg Martin
Publication year - 2001
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.00481
Subject(s) - strips , encoding (memory) , computer science , triangle mesh , set (abstract data type) , compression (physics) , algorithm , simple (philosophy) , representation (politics) , exploit , scheme (mathematics) , theoretical computer science , computer graphics (images) , mathematics , polygon mesh , artificial intelligence , mathematical analysis , philosophy , materials science , computer security , epistemology , politics , political science , law , composite material , programming language
In this paper we introduce a simple and efficient scheme for encoding the connectivity and the stripification of a triangle mesh. Since generating a good set of triangle strips is a hard problem, it is desirable to do this just once and store the computed strips with the triangle mesh. However, no previously reported mesh encoding scheme is designed to include triangle strip information into the compressed representation. Our algorithm encodes the stripification and the connectivity in an interwoven fashion, that exploits the correlation existing between the two.