Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination

摘要

An efficient algorithm, HALO, is given to compute haloed line drawings of wire frame objects. HALO has two parts: CUT and DRAW. CUT uses an adaptive grid to find all edge intersections. CUT writes a file containing all the locations where each edge is crossed in front by another.