Area-efficient pixel rasterization and texture coordinate interpolation

Cited 3 time in webofscience Cited 11 time in scopus
  • Hit : 558
  • Download : 0
in this paper, new pixel rasterization and texture coordinate interpolation algorithms are presented to reduce silicon area. The proposed pixel rasterization based on the characteristics of edge function saves silicon area in terms of gate count by 38.9% and 35.3% compared to the previous centerline and scanline algorithms, respectively. The proposed texture coordinate interpolation combines the benefits of division and midpoint iteration in order to reduce silicon area without performance loss in computing the fraction part of texture coordinates, which is required for texture filtering. The proposed texture coordinate interpolation architecture uses less silicon gates than the architecture using dividers, and the gate count reduction ratios are 25.2% and 37.0% for 16- and 32-bit texture coordinates, respectively. The hardware feasibility of the proposed architecture is proved by implementation into a three-dimensional (3D) graphics SoC. (c) 2008 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2008-12
Language
English
Article Type
Article
Keywords

ARCHITECTURE; GRAPHICS; PIPELINE

Citation

COMPUTERS & GRAPHICS-UK, v.32, no.6, pp.669 - 681

ISSN
0097-8493
DOI
10.1016/j.cag.2008.08.007
URI
http://hdl.handle.net/10203/11105
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0