Tile-based texture mapping on graphics hardware
- 29 August 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
Texture mapping has been a fundamental feature for commodity graphics hardware. However, a key challenge for texture mapping is how to store and manage large textures on graphics processors. In this paper, we present a tile-based texture mapping algorithm by which we only have to physically store a small set of texture tiles instead of a large texture. Our algorithm generates an arbitrarily large and non-periodic virtual texture map fròm the small set of stored texture tiles. Because we only have to store a small set of tiles, it minimizes the storage requirement to a small constant, regardless of the size of the virtual texture. In addition, the tiles are generated and packed into a single texture map, so that the hardware filtering of this packed texture map corresponds directly to the filtering of the virtual texture. We implement our algorithm as a fragment program, and demonstrate performance on latest graphics processors.Keywords
This publication has 17 references indexed in Scilit:
- Wang Tiles for image and texture generationACM Transactions on Graphics, 2003
- Linear algebra operators for GPU implementation of numerical algorithmsACM Transactions on Graphics, 2003
- CgACM Transactions on Graphics, 2003
- Sparse matrix solvers on the GPUACM Transactions on Graphics, 2003
- Graphcut texturesACM Transactions on Graphics, 2003
- View-dependent displacement mappingACM Transactions on Graphics, 2003
- Pattern based procedural texturesPublished by Association for Computing Machinery (ACM) ,2003
- Improving noiseACM Transactions on Graphics, 2002
- Hierarchical pattern mappingACM Transactions on Graphics, 2002
- Image quilting for texture synthesis and transferPublished by Association for Computing Machinery (ACM) ,2001