Depth Sorting by Windowing

Simple item page
dc.contributor.authorGangnet, Michelen_US
dc.contributor.editorP.J.W. ten Hagenen_US
dc.date.accessioned2015-09-29T08:29:01Z
dc.date.available2015-09-29T08:29:01Z
dc.date.issued1983en_US
dc.description.abstractIn this paper we present the first version of a new algorithm for hidden-surface and hidden-line elimination which applies primarily to the generation of indoor perspective views of simple building models. The algorithm is very efficient and though being an object space algorithm its run-time depends only on the complexity of the generated picture. The algorithm is recursive and uses extensively the coherence given by the adjacencies of the rooms within a building. Extensions to more complex models are considered.en_US
dc.description.seriesinformationEurographics Conference Proceedingsen_US
dc.identifier.doi10.2312/eg.19831025en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/eg.19831025en_US
dc.publisherThe Eurographics Associationen_US
dc.titleDepth Sorting by Windowingen_US
Files
Collections
EG1983 Proceedings (Technical Papers)
EG 1983 Proceedings (Technical Papers)