Warnock hidden line algorithm implemented in SIMULA 67

Includes bibliographical references (page 40)The purpose of this graduate project was to implement the Warnock Hidden Line Algorithm described in the Principles of Interactive Computer Graphics by William M. Newman and Robert F. Sproull, in SIMULA on the CDC 3170/3300 computer. The algorithm was modified twice to decrease the execution time. The first modification deleted the processing of areas where no edges existed. The second modification stopped execution for progressively smaller windows of an area after an edge was drawn. Using the SIMULA procedure ELAPSED, the modified algorithm???s execution time was determined to be a linear function of the number of polygons that are input for analysis. Therefore the execution time required for a problem containing three for sided polygons. The algorithm was also modified to allow polygons with common edges to be processed