Triangle scan conversion using 2D homogeneous coordinates

41Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.

Abstract

We present a new triangle scan conversion algorithm that works entirely in homogeneous coordinates. By using homogeneous coordinates, the algorithm avoids costly clipping tests which make pipelining or hardware implementations of previous scan conversion algorithms difficult. The algorithm handles clipping by the addition of clip edges, without the need to actually split the clipped triangle. Furthermore, the algorithm can render true homogeneous triangles, including external triangles that should pass through infinity with two visible sections. An implementation of the algorithm on Pixel-Planes 5 runs about 33% faster than a similar implementation of the previous algorithm.

Cite

CITATION STYLE

APA

Olano, M., & Greer, T. (1997). Triangle scan conversion using 2D homogeneous coordinates. In Proceedings of the SIGGRAPH/Eurographics Workshop on Graphics Hardware (pp. 89–95). ACM. https://doi.org/10.1145/258694.258723

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free