Skip to search formSkip to main contentSkip to account menu

Octree

Known as: Oct tree, Oct-tree, Octtree 
An octree is a tree data structure in which each internal node has exactly eight children. Octrees are most often used to partition a three… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
In low-frequency, or dense-mesh problems, the electric field integral equation (EFIE) discretization requires the extraction of… 
Highly Cited
2005
Highly Cited
2005
This paper describes the predetermined interaction list oct-tree (PILOT) algorithm and its application in expediting the solution… 
2002
2002
We present iWalk, a system for interactive out-of-core rendering of large models on an inexpensive PC. The system uses a new… 
2002
2002
Techniques are presented to progressively approximate and compress in a lossless manner two-colored (i.e. binary) 3D objects (as… 
2002
2002
This paper concerns digital image compression using adaptive thinning algorithms. Adaptive thinning is a recursive point removal… 
1997
1997
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or… 
Highly Cited
1996
Highly Cited
1996
In this paper, we study data structures for use in N-body simulation. We concentrate on the spatial decomposition tree used in… 
Highly Cited
1988
Highly Cited
1988
A fast, efficient, algorithm that processes polyhedral cones from views of an object to produce an octree representation of the…