Fast Generation of Pointerless Octree Duals

@article{Lewiner2010FastGO,
  title={Fast Generation of Pointerless Octree Duals},
  author={Thomas Lewiner and Vin{\'i}cius Mello and Adelailson Peixoto and Sin{\'e}sio Pesco and H{\'e}lio Lopes},
  journal={Comput. Graph. Forum},
  year={2010},
  volume={29},
  pages={1661-1669}
}
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… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

and A . Bordignon . Statistical optimization of octree searches

  • E. Ju, J.-W. Chang, J. Lee
  • Computer Graphics Forum
  • 2008

Similar Papers

Loading similar papers…