我在哪里存储在一个八叉树的形状？
什么是2：1平衡线性八叉树的算法吗？
提出了基于线性八叉树的加速体绘制算法。
In this paper, an algorithm is proposed for the accelerated rendering of volume on linear octrees basis.
本文提出了一种矩阵式八叉树的存储结构。
利用八叉树表示物体，在实体造型系统中具有许多优点。
Using octree structure to present object in solid modelling systems has many advantages.
八叉树方法是一种基于对象分布自适应细分模式的空间细分方法。
Octree method is a kind of self-adapt spatial subdivision method based on object distribution.
给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
本文采用了基于空间分割方法的八叉树算法并对该算法进行了改进。
In this paper, an octree algorithm based on spatial partitioning system is adopted and improved.
对于模型空间中的任何形状的实体都可以由八叉树法分割的立方体序列来表示。
The entities of any shape for model space can all be denoted by intersected cube sequence by octrees.
并用体元投射和三维纹理映射方法分别实现了混合八叉树的体绘制与多分辨率绘制。
Volume rendering and multi-resolution rendering for hybrid octree via cell projection and 3D-texture mapping are implemented.
在实时绘制阶段，利用八叉树层次进行粗的全局细化，利用渐进网格进行细的局部细化。
At run time, the octree hierarchy was used for coarse global refinement, and the progressive meshes was used for fine local refinement.
八叉树不易表达场景的相邻结点，本文设计了邻域查找算法以进行八叉树中相邻结点的查询。
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.
为了应用计算机图形学中高效的3维物体碰撞检查的分离轴理论，对自由曲面进行八叉树建模。
In order to apply the separating axis theory, which is effective in solving 3d object collision problems in computer graphics, an octree is used to approximate the freeform surfaces.
分析了线性四叉树、线性八叉树两种数据结构的特点，介绍了一种基于十进制的线性八叉树编码技术。
Analyze the Characteristics of the linear quadtree and linear octree and describe the linear octree encoding based on the decimal system.
基于数据分区、八叉树索引、访问预测等相关技术，实现海量数据的快速访问、快速检索、空间算法等。
The fast accessing, indexing and spatial computation algorithm is based on data redistribution, oct-tree indexing an...
针对如何快速求取空间点到STL模型表面有符号距离这一问题，提出一种基于线性八叉树的参考球方法。
For fast calculating the signed distance from spatial point to STL model, a reference ball method was put foward based on linear octree.
本文还根据八叉树这种数据结构的特点及一评价函数，提出了一种定向搜索算法来求解布局物体的装卸路径。
According to the octree's characteristics and an evaluation function, a directional search algorithm is presented for solving loading paths of packing objects.
在介绍当前体数据的数据模型与绘制方法的基础上，使用混合八叉树进行体数据的描述，实现了对其自适应分块存储。
Based on the introduction of common data models and rendering algorithms for volume data, this paper proposes a hybrid octree encoding to describe it.
主要讨论用八叉树对三维图形进行处理的特点以及由三维图形到八叉树转换的算法，同时介绍线性八叉树的基本思想。
This paper mainly discusses the feature of processing 3D graphics with octree structure and the algorithm of converting 3D graphics into octree structure.
线性八叉树编码是一种有效的表示三维物体的方法。给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
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.
综合考虑所摄图像序列中包含的几何轮廓信息与光亮度信息，采用立体相交技术和剥离技术，逐步求精地得到三维物体的八叉树表示。
Taking account of both silhouette information and intensity information in images, a carving algorithm is used to incrementally recovery the octree model of the object.
通过分析彩色图像的数据格式，将八叉树量化方法用于彩色图像的颜色信息量化，并采用矢量中值滤波消除彩色图像噪声，以实现对彩色图像的合理预处理。
Then the experimental results show that the vector median filtering algorithm based on PCNN and HIS not only can effectively remove the noise, but also can protect the details of color image better.
以八叉剖分来建立一棵顶点树，用以表示整个网格模型的数据结构。
A vertex tree is built to represent the data structure of the models by octonary subdivision.
在基于顶点聚类的网格简化算法中，通常对网格模型进行八叉剖分来建立一棵顶点树以表示整个网格模型的数据结构；
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.
说明：天龙八部易语言二叉树源码，可历遍背包，人物，商店物品等等。
Dragon easy language binary tree source, through backpacks, figures, store items and so on.
说明：天龙八部易语言二叉树源码，可历遍背包，人物，商店物品等等。
Dragon easy language binary tree source, through backpacks, figures, store items and so on.
应用推荐