1·An octree is actually nothing more then a data structure.
一个八叉树实际上就是一个数据结构。
2·Where do I store shapes in an octree?
我在哪里存储在一个八叉树的形状？
3·Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
4·Octree method is a kind of self-adapt spatial subdivision method based on object distribution.
八叉树方法是一种基于对象分布自适应细分模式的空间细分方法。
5·For fast calculating the signed distance from spatial point to STL model, a reference ball method was put foward based on linear octree.
针对如何快速求取空间点到STL模型表面有符号距离这一问题，提出一种基于线性八叉树的参考球方法。