Packing Square Tiles into One Texture
dc.contributor.author | Decaudin, Philippe | en_US |
dc.contributor.author | Neyret, Fabrice | en_US |
dc.contributor.editor | M. Alexa and E. Galin | en_US |
dc.date.accessioned | 2015-07-20T09:40:43Z | |
dc.date.available | 2015-07-20T09:40:43Z | |
dc.date.issued | 2004 | en_US |
dc.identifier.issn | 1017-4656 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/egs.20041003 | en_US |
dc.description.abstract | This paper deals with the packing of square tiles of the same size into one texture. Texture size is constrained by the graphics hardware. In particular, width and height resolutions must be powers of two. To cover the whole texture and avoid space loss, common schemes pack a number of tiles that is a power of two. We show that numbers of tiles like 5, 13, 17, 25, 34 and others can also be reached without wasting memory. To achieve this, our scheme takes advantage of texture rotation and the wrapping capability of texture-addressing, which gives a torus topology to the texture space. | en_US |
dc.publisher | Eurographics Association | en_US |
dc.title | Packing Square Tiles into One Texture | en_US |
dc.description.seriesinformation | Eurographics 2004 - Short Presentations | en_US |
dc.identifier.doi | 10.2312/egs.20041003 | en_US |
Files in this item
This item appears in the following Collection(s)
-
Short Presentations
Eurographics 2004 - Short Presentations