dc.contributor.author | Isenburg, Martin | en_US |
dc.date.accessioned | 2015-02-16T07:13:02Z | |
dc.date.available | 2015-02-16T07:13:02Z | |
dc.date.issued | 2001 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/1467-8659.00481 | en_US |
dc.description.abstract | 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. | en_US |
dc.publisher | Blackwell Publishers Ltd and the Eurographics Association | en_US |
dc.title | Triangle Strip Compression | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 20 | en_US |
dc.description.number | 2 | en_US |
dc.identifier.doi | 10.1111/1467-8659.00481 | en_US |
dc.identifier.pages | 91-101 | en_US |