AN APPROACH TO A CALCULATION-MINIMIZED HIDDEN LINE ALGORITHM

Simple item page
dc.contributor.authorHornung, Christophen_US
dc.contributor.editorJ. L. Encarnacaoen_US
dc.date.accessioned2015-09-29T08:26:11Z
dc.date.available2015-09-29T08:26:11Z
dc.date.issued1981en_US
dc.description.abstractHidden 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.en_US
dc.description.seriesinformationEurographics Conference Proceedingsen_US
dc.identifier.doi10.2312/eg.19811004en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/eg.19811004en_US
dc.publisherThe Eurographics Associationen_US
dc.titleAN APPROACH TO A CALCULATION-MINIMIZED HIDDEN LINE ALGORITHMen_US
Files
Collections
EG1981 Proceedings (Technical Papers)