A polygonal approach to hidden-line and hidden-surface elimination
Michael T. Goodrich · CVGIP Graphical Models and Image Processing · 1992
this paper we give an algorithm for the hidden-line elimination problem that is optimal in the worst case, and also takes advantage of problem instances that are "simpler" than in the worst case. Intuitively, our approach is to exploit the polygonal 2