Show simple item record

dc.contributor.authorMasso, J. P. Molinaen_US
dc.contributor.authorLopez, P. Gonzalezen_US
dc.date.accessioned2015-02-16T07:30:17Z
dc.date.available2015-02-16T07:30:17Z
dc.date.issued2003en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/1467-8659.t01-1-00641en_US
dc.description.abstractWhile using hierarchical search structures has been proved as one of the most efficient acceleration techniques when rendering complex scenes, automatic creation of appropriate hierarchies is not solved yet. Well-known algorithms for automatic creation of bounding volume hierarchies are not enough. Higher performance is achieved by introducing spatial uniform subdivision, although algorithms proposed up to now are not truly automatic, as they need some parameters to be adjusted. In this paper we present a full-automatic hierarchy creation scheme that structures the scene in a hybrid way, combining bounding volumes and voxel grids in the same tree, selecting the search structure that best fits to each scene region. It uses no parameters at all. This efficient proposal relies on a new cost model that estimates the goodness of a hybrid hierarchy if used for rendering the scene.ACM CSS: I.3.7 Computer Graphics-Three-Dimensional Graphics and Realismen_US
dc.publisherBlackwell Publishers, Inc and the Eurographics Associationen_US
dc.titleAutomatic Hybrid Hierarchy Creation: a Cost-model Based Approachen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume22en_US
dc.description.number1en_US
dc.identifier.doi10.1111/1467-8659.t01-1-00641en_US
dc.identifier.pages5-13en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record