Applications of the method of invariants in computer graphics
Proceedings of a workshop (Eurographics Seminars on Data structures for raster graphics
Digital Image Warping
MIP-Map Level Selection for Texture Mapping
IEEE Transactions on Visualization and Computer Graphics
IEEE Computer Graphics and Applications
3-D transformations of images in scanline order
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Technical Section: Area-efficient pixel rasterization and texture coordinate interpolation
Computers and Graphics
| Hi-index | 0.00 |
Well known implemetations for perspective correct rendering of planar polygons require a division per rendered pixel. Such a division is better to be avoided as it is an expensive operation in terms of silicon gates and clock cycles. In this paper we present a family of efficient midpoint algorithms that can be used to avoid division operators. These algorithms do not require more than a small number of additions per pixel. We show how these can be embedded in scan line algorithms and in algorithms that use mipmaps. Experiments with software implementations show that the division free algorithms are a factor of two faster, provided that the polygons are not too small. These algorithms are however most profitable when realised in hardware.