Incremental and Hierarchical Hilbert Order Edge Equation Polygon Rasterization

Thumbnail Image
Date
2001
Authors
McCool, Michael D.
Wales, Cluis
Moule, Kevin
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
A rasterization algorithm must efficiently generate pixel fragments from geometric descriptions of primitives. ln order to accomplish per-pixel shading, shading parameters must also be interpolated across the primitive in a perspective-correct manner. lf 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 incrementale valuation of edge and interpolation equations.
Description

        
@inproceedings{
:10.2312/EGGH/EGGH01/065-072
,
booktitle = {
Eurographics/SIGGRAPH Graphics Hardware Workshop 2001
},
editor = {
Kurt Akeley and Ulrich Neumann
},
title = {{
Incremental and Hierarchical Hilbert Order Edge Equation Polygon Rasterization
}},
author = {
McCool, Michael D.
 and 
Wales, Cluis
 and 
Moule,  Kevin
},
year = {
2001
},
publisher = {
The Eurographics Association
},
ISSN = {
1727-3471
},
ISBN = {
158113407X
},
DOI = {
/10.2312/EGGH/EGGH01/065-072
}
}
Citation
URI
https://doi.org/10.2312/EGGH/EGGH01/065-072
Collections
EGGH01: SIGGRAPH/Eurographics Workshop on Graphics Hardware 2001