AN APPROACH TO A CALCULATION-MINIMIZED HIDDEN LINE ALGORITHM

Abstract

Hidden line algorithms based on picture primitives only cannot recognize the areas of a picture completely visible or invisible. By testing each primitive of these areas they produce an overhead of calculations. Moreover they waste time by calculating the hidden lines explicitely and outputting the remaining edges. This paper describes a method which rather computes the visible parts of a picture than excludes the invisible ones. Furtheron an approach to recognize complete visible areas instead of single visible edges is made. A comparison with other techniques shows the qualitatively better computation time.