本文采用了基于空间分割方法的八叉树算法并对该算法进行了改进。
In this paper, an octree algorithm based on spatial partitioning system is adopted and improved.
给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
在基于顶点聚类的网格简化算法中，通常对网格模型进行八叉剖分来建立一棵顶点树以表示整个网格模型的数据结构；
In the algorithm of mesh simplification based on vertex clustering, a vertex tree is built to represent the data structure of the models by octonary subdivision.
本文还根据八叉树这种数据结构的特点及一评价函数，提出了一种定向搜索算法来求解布局物体的装卸路径。
According to the octree's characteristics and an evaluation function, a directional search algorithm is presented for solving loading paths of packing objects.
什么是2：1平衡线性八叉树的算法吗？
线性八叉树编码是一种有效的表示三维物体的方法。给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
Linear octree encoding provides a effective way for tridimensional of objects. Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
提出了基于线性八叉树的加速体绘制算法。
In this paper, an algorithm is proposed for the accelerated rendering of volume on linear octrees basis.
八叉树不易表达场景的相邻结点，本文设计了邻域查找算法以进行八叉树中相邻结点的查询。
In view of that the octree is not easy to express the adjacent nodes, we design a neighborhood search algorithms for querying the adjacent nodes.
基于数据分区、八叉树索引、访问预测等相关技术，实现海量数据的快速访问、快速检索、空间算法等。
The fast accessing, indexing and spatial computation algorithm is based on data redistribution, oct-tree indexing an...
主要讨论用八叉树对三维图形进行处理的特点以及由三维图形到八叉树转换的算法，同时介绍线性八叉树的基本思想。
This paper mainly discusses the feature of processing 3D graphics with octree structure and the algorithm of converting 3D graphics into octree structure.
主要讨论用八叉树对三维图形进行处理的特点以及由三维图形到八叉树转换的算法，同时介绍线性八叉树的基本思想。
This paper mainly discusses the feature of processing 3D graphics with octree structure and the algorithm of converting 3D graphics into octree structure.
应用推荐