A power-area efficient geometry engine with low-complexity subdivision algorithm for 3-d graphics system

Lan-Da Van*, Ten Yao Sheu

*Corresponding author for this work

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

In this paper, a power-area efficient geometry engine (GE) using a low-complexity three-level subdivision algorithm is presented. The proposed subdivision algorithm and architecture is capable of providing low complexity, high power-area efficiency, scalable and near-Phong shading quality. The forward difference, edge function recovery, dual space subdivision, triangle filtering, and triangle setup coefficient sharing schemes are employed to alleviate the redundant computation for the proposed algorithm. According to the low-complexity subdivision algorithm, one reconfigurable datapath is proposed to save the area since the same set of processing elements (PE) is reused for different operations of GE. Compared with the conventional subdivision algorithm, the proposed subdivision algorithm reduces the number of memory/register accesses for subdivision by 40% and 60.32% for level-1 and level-2 subdivision, respectively. In terms of the number of multiplications for transforms, the reduction can be attained by 27.5% and 60.27% for level-1 and level-2 subdivision, respectively. From the implementation results, the proposed GE can achieve the power-area efficiency of 518.8\Kvertices s•etmW•et-2 for level-1 subdivision.

Original languageEnglish
Article number5741869
Pages (from-to)2211-2224
Number of pages14
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Volume58
Issue number9
DOIs
StatePublished - 7 Apr 2011

Keywords

  • Forward difference
  • geometry engine
  • near-Phong shading
  • power-area efficient
  • subdivision

Fingerprint Dive into the research topics of 'A power-area efficient geometry engine with low-complexity subdivision algorithm for 3-d graphics system'. Together they form a unique fingerprint.

  • Cite this