The object instancing paradigm for linear fractal modeling
Proceedings of the conference on Graphics interface '92
Hierarchical polygon tiling with coverage masks
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Triangle scan conversion using 2D homogeneous coordinates
HWWS '97 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Fast spheres, shadows, textures, transparencies, and imgage enhancements in pixel-planes
SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
Tiled polygon traversal using half-plane edge functions
HWWS '00 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
A parallel algorithm for polygon rasterization
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
A quadrilateral rendering primitive
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Hexagonal storage scheme for interleaved frame buffers and textures
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Shader Performance Analysis on a Modern GPU Architecture
Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture
ACM Transactions on Graphics (TOG)
PCU: the programmable culling unit
ACM SIGGRAPH 2007 papers
Stochastic rasterization using time-continuous triangles
Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Practical logarithmic rasterization for low-error shadow maps
Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
A Hilbert-order multiplication scheme for unstructured sparse matrices
International Journal of Parallel, Emergent and Distributed Systems
Logarithmic perspective shadow maps
ACM Transactions on Graphics (TOG)
Technical Section: Area-efficient pixel rasterization and texture coordinate interpolation
Computers and Graphics
Data-parallel rasterization of micropolygons with defocus and motion blur
Proceedings of the Conference on High Performance Graphics 2009
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Hardware implementation of micropolygon rasterization with motion and defocus blur
Proceedings of the Conference on High Performance Graphics
Analytical motion blur rasterization with compression
Proceedings of the Conference on High Performance Graphics
Hierarchical stochastic motion blur rasterization
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
Image-based fast small triangle rasterization
ICAT'06 Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence
A single (unified) shader GPU microarchitecture for embedded systems
HiPEAC'05 Proceedings of the First international conference on High Performance Embedded Architectures and Compilers
3D rasterization: a bridge between rasterization and ray casting
Proceedings of Graphics Interface 2012
An efficient multi-view rasterization architecture
EGSR'06 Proceedings of the 17th Eurographics conference on Rendering Techniques
Study on rasterization algorithm for graphics acceleration system
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part V
| Hi-index | 0.00 |
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.