Algorithms for Division Free Perspective Correct Rendering

dc.contributor.authorBarenbrug, B.en_US
dc.contributor.authorPeters, F.J.en_US
dc.contributor.authorOverveld, C.W.A.M. vanen_US
dc.contributor.editorI. Buck and G. Humphreys and P. Hanrahanen_US
dc.date.accessioned2013-10-28T09:57:01Z
dc.date.available2013-10-28T09:57:01Z
dc.date.issued2000en_US
dc.description.abstractWell known implementations 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.en_US
dc.description.seriesinformationSIGGRAPH/Eurographics Workshop on Graphics Hardwareen_US
dc.identifier.isbn1-58113-257-3en_US
dc.identifier.issn1727-3471en_US
dc.identifier.urihttps://doi.org/10.2312/EGGH/EGGH00/007-013en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.3 [Computer Graphics]en_US
dc.subjectpicture/image generationen_US
dc.subjectDisplay algorithmsen_US
dc.subjectI.3.7 [Computer Graphics]en_US
dc.subjectthree dimensional graphics and realismen_US
dc.subjectcoloren_US
dc.subjectshadingen_US
dc.subjectshadowing and textureen_US
dc.titleAlgorithms for Division Free Perspective Correct Renderingen_US
Files