Fast generation of pointerless octree duals

Fast generation of pointerless octree duals
Thomas Lewiner, Vinícius Mello, Adelailson Peixoto, Sinésio Pesco, Hélio Lopes

Symposium on Geometry Processing 2010 (Computer Graphics Forum 29(5)): pp. 1661-1669 (july 2010)


Geometry 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.


PDF paper (1.9 MB)
source code (4.9 MB)
Keynote presentation (15.3 MB)
Slides in PDF (9.3 MB)
Fast generation of pointerless octree duals


    author = {Thomas Lewiner and Vinícius Mello and Adelailson Peixoto and Sinésio Pesco and Hélio Lopes},
    title = {Fast generation of pointerless octree duals},
    year = {2010},
    month = {july},
    booktitle = {Symposium on Geometry Processing 2010 (Computer Graphics Forum)},
    volume = {29},
    number = {5},
    pages = {1661--1669},
    publisher = {Wiley},
    address = {Lyon, France},
    doi = {10.1111/j.1467-8659.2010.01775.x},
    url = {\url{}}

Last modifications on July 3rd, 2013