Olano, MarcGreer, TreyA. Kaufmann and W. Strasser and S. Molnar and B.-O. Schneider2014-02-062014-02-0619970-89791-961-01727-3471http://dx.doi.org/10.2312/EGGH/EGGH97/089-095We 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.1.3.1 (Computer Graphics]Hardware ArchitectureParallel Processing1.3.3 [Computer Graphics]Picture/Image Generation1.3.7 [Computer Graphics]Three Dimensional Graphics and RealismVisible line/surface algorithms.