Optimization of a Priority List Algorithm for 3-D Rendering of Buildings

Simple item page
dc.contributor.authorMorer, Pazen_US
dc.contributor.authorAlonso, Alejandro M. Garciaen_US
dc.contributor.authorFlaquer, Juanen_US
dc.date.accessioned2014-10-21T07:38:40Z
dc.date.available2014-10-21T07:38:40Z
dc.date.issued1995en_US
dc.description.abstractArchitectural scenes usually have some peculiar properties, like parallel surfaces, symmetry, instantiation, easy clustering, etc. These properties can be used by visualization algorithms in order to improve the solution of the hidden surface removal problem.This paper presents some practical implementation policies for the binary space partition algorithm proposed by Fuchs. They take advantage of the characteristics found in architectural scenes. These suggestions help to minimize both the time needed to build the tree and the memory space used. Five optimization techniques are presented and applied to fourteen architectural scenes.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume14en_US
dc.identifier.doi10.1111/1467-8659.1440217en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages217-227en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1440217en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleOptimization of a Priority List Algorithm for 3-D Rendering of Buildingsen_US
Files
Collections
Issue 4