Statistical optimization of octree searches

Simple item page
dc.contributor.authorCastro, Reneren_US
dc.contributor.authorLewiner, Thomasen_US
dc.contributor.authorLopes, Helioen_US
dc.contributor.authorTavares, Geovanen_US
dc.contributor.authorBordignon, Alexen_US
dc.date.accessioned2015-02-21T13:15:35Z
dc.date.available2015-02-21T13:15:35Z
dc.date.issued2008en_US
dc.description.abstractThis work emerged from the following observation: usual search procedures for octrees start from the root to retrieve the data stored at the leaves. But as the leaves are the farthest nodes to the root, why start from the root? With usual octree representations, there is no other way to access a leaf. However, hashed octrees allow direct access to any node, given its position in space and its depth in the octree. Search procedures take the position as an input, but the depth remains unknown. This work proposes to estimate the depth of an arbitrary node through a statistical optimization of the average cost of search procedures. As the highest costs of these algorithms are obtained when starting from the root, this method improves on both the memory footprint by the use of hashed octrees, and execution time through the proposed optimization.en_US
dc.description.number6en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume27en_US
dc.identifier.doi10.1111/j.1467-8659.2007.01104.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages1557-1566en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2007.01104.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleStatistical optimization of octree searchesen_US
Files
Collections
27-Issue 6