Show simple item record

dc.contributor.authorDecaudin, Philippeen_US
dc.contributor.authorNeyret, Fabriceen_US
dc.contributor.editorM. Alexa and E. Galinen_US
dc.date.accessioned2015-07-20T09:40:43Z
dc.date.available2015-07-20T09:40:43Z
dc.date.issued2004en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttp://dx.doi.org/10.2312/egs.20041003en_US
dc.description.abstractThis 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.publisherEurographics Associationen_US
dc.titlePacking Square Tiles into One Textureen_US
dc.description.seriesinformationEurographics 2004 - Short Presentationsen_US
dc.identifier.doi10.2312/egs.20041003en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record