Fast Generation of Pointerless Octree Duals

Simple item page
dc.contributor.authorThomas Lewineren_US
dc.contributor.authorVinicius Melloen_US
dc.contributor.authorAdelailson Peixotoen_US
dc.contributor.authorSinesio Pescoen_US
dc.contributor.authorHelio Lopesen_US
dc.date.accessioned2015-02-23T17:15:39Z
dc.date.available2015-02-23T17:15:39Z
dc.date.issued2010en_US
dc.description.abstractGeometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee direct continuous interpolation of this data inside its nodes. This motivates the use of the octree's dual structure, which is one of the simplest continuous hierarchical structures. With the emergence of pointerless representations, with their ability to reduce memory footprint and adapt to parallel architectures, the generation of duals of pointerless octrees becomes a natural challenge. This work proposes strategies for dual generation of static or dynamic pointerless octrees. Experimentally, those methods enjoy the memory reduction of pointerless representations and speed up the execution by several factors compared to the usual recursive generation.en_US
dc.description.number5en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2010.01775.xen_US
dc.identifier.pages1661-1669en_US
dc.identifier.urihttps://diglib.eg.org/handle/10.2312/CGF.v29i5pp1661-1669en_US
dc.identifier.urihttps://diglib.eg.org/handle/10.2312/CGF.v29i5pp1661-1669
dc.titleFast Generation of Pointerless Octree Dualsen_US
Files
Collections
29-Issue 5
SGP10: Eurographics Symposium on Geometry Processing