Skip to main content
Article thumbnail
Location of Repository

Incremental and Hierarchical Hilbert Order Edge Equation Polygon Rasterization

By Michael McCool, Chris Wales and Kevin Moule

Abstract

A rasterization algorithm must efficiently generate pixel fragments from geometric descriptions of primitives. In order to accomplish per-pixel shading, shading parameters must also be interpolated across the primitive in a perspective-correct manner. If some of these parameters are to be interpreted in later stages of the pipeline directly or indirectly as texture coordinates, then translating spatial and parametric coherence into temporal coherence will improve texture cache performance. Finally, if framebuffer access is also organized around cached blocks, then organizing rasterization so fragments are generated in block-sequential order will maximize framebuffer cache performance. Hilbert-order rasterization accomplishes these goals, and also permits efficient incremental evaluation of edge and interpolation equations

Topics: Hardware accelerated image synthesis and shading
Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.5738
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cgl.uwaterloo.ca/Pr... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.