Elsevier

Computers & Graphics

Volume 20, Issue 4, July–August 1996, Pages 475-481
Computers & Graphics

Hardware for superior texture performance

https://doi.org/10.1016/0097-8493(96)00019-2Get rights and content

Abstract

Mapping textures onto surfaces of computer-generated objects is a technique which greatly improves the realism of their appearance. Unfortunately, this imposes high computational demands and, even worse, tremendous memory bandwidth requirements on the graphics system. Tight cost frames in the industry in conjunction with ever increasing user expectations make the design of a powerful texture mapping unit a difficult task. To meet these requirements we follow two different approaches. On the technology side, we observe a rapidly emerging technology which offers the combination of enormous transfer rates and computing power: logic-embedded memories. On the algorithmic side, a common way to reduce data traffic is image compression. Its application to texture mapping, however, is difficult since the decompression must be done at pixel frequency. In this work we will focus on the latter approach, describing the use of a specific compression scheme for texture mapping. It allows the use of a very simple and fast decompression hardware, bringing high performance texture mapping to low-cost systems.

References (12)

  • H.C. Andrews et al.
  • F.C. Crow

    Summed-area tables for texture mapping

    Computer Graphics

    (1984)
  • A. Glassner

    Adaptive precision in texture mapping

    Computer Graphics

    (1986)
  • L. Williams

    Pyramidal parametrics

    Computer Graphics

    (1983)
  • P. Heckbert

    Texture Mapping Polygons in Perspective, NYIT Computer Graphics Lab Technical Memo #13

    (1983)
  • A. Schilling et al.

    TEXRAM-a smart memory for texturing

    IEEE Computer Graphics and Applications

    (1996)
There are more references available in the full text version of this article.

Cited by (40)

  • Generalization of 3D building texture using image compression and multiple representation data structure

    2013, ISPRS Journal of Photogrammetry and Remote Sensing
    Citation Excerpt :

    Early studies contained Block truncation coding (Delp and Mitchell, 1979) for gray images and Color Cell compression (Campbell et al., 1986) for color images. Knittel et al. (1996) first implemented the block-based method into hardware. Nowadays, the most common method is S3 Texture compression (Iourcha et al., 1999), which is implemented both in OpenGL and Direct3D and widely used in different applications.

  • Ftc-Floating precision texture compression

    2010, Computers and Graphics (Pergamon)
    Citation Excerpt :

    Color Cell compression (CCC), a generalization of BTC for color images, was proposed by Campbell et al. [11]; it essentially is indexed color done separately for each block. This was the first approach to be considered for hardware implementation as a texture compression system by Knittel et al. [22]. The most common texture compression system today is S3TC [9], which offers 5 formats, with the most important being DXT1 for RGB images and DXT5 for RGBA images.

  • A novel data hiding algorithm for game texture based on hamming+1

    2019, ACM International Conference Proceeding Series
  • Advanced high dynamic range imaging, second edition

    2017, Advanced High Dynamic Range Imaging, Second Edition
  • GST: GPU-decodable Supercompressed Textures

    2016, ACM Transactions on Graphics
View all citing articles on Scopus
View full text