Depth Sorting by Windowing
Abstract
In 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.
BibTeX
@inproceedings {10.2312:eg.19831025,
booktitle = {Eurographics Conference Proceedings},
editor = {P.J.W. ten Hagen},
title = {{Depth Sorting by Windowing}},
author = {Gangnet, Michel},
year = {1983},
publisher = {The Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/eg.19831025}
}
booktitle = {Eurographics Conference Proceedings},
editor = {P.J.W. ten Hagen},
title = {{Depth Sorting by Windowing}},
author = {Gangnet, Michel},
year = {1983},
publisher = {The Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/eg.19831025}
}