Where do I store shapes in an octree?
我在哪里存储在一个八叉树的形状？
You could also apply the octree to many other things.
你可以应用八叉树到很多别的地方。
What's the algorithm for 2:1 balancing a linear octree?
什么是2：1平衡线性八叉树的算法吗？
An octree is actually nothing more then a data structure.
一个八叉树实际上就是一个数据结构。
A new storage structure, named matrix octree, is given out.
本文提出了一种矩阵式八叉树的存储结构。
It is an efficient way to represent three-dimensional (3d) objects by octree.
利用八元树表示三维物体是一种十分有效的方法。
It is an excellent way to use octree for representing three-dimensional (3d) space.
八元树是一种优秀的三维空间表示方法。
Using octree structure to present object in solid modelling systems has many advantages.
利用八叉树表示物体，在实体造型系统中具有许多优点。
Raymond C W Sung. Jonathan R comey. Doug E R Clark Octree Based Assembly Sequence Generation.
张建标。魏生民。杨彭基基于割集的装配顺序生成方法。
Octree method is a kind of self-adapt spatial subdivision method based on object distribution.
八叉树方法是一种基于对象分布自适应细分模式的空间细分方法。
Unstructured Cartesian grid for complex geometries is generated based on Octree data structure.
采用八叉树结构，生成复杂外形绕流计算的非结构直角网格。
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.
给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
Volume rendering and multi-resolution rendering for hybrid octree via cell projection and 3D-texture mapping are implemented.
并用体元投射和三维纹理映射方法分别实现了混合八叉树的体绘制与多分辨率绘制。
First we get the square surfel representation to replace triangular mesh, Then encode the square surfel with octree linear code.
对于给定的网格曲面，首先将其转换为正方形面元表示，然后对正方形面元进行编码压缩。
At run time, the octree hierarchy was used for coarse global refinement, and the progressive meshes was used for fine local refinement.
在实时绘制阶段，利用八叉树层次进行粗的全局细化，利用渐进网格进行细的局部细化。
For fast calculating the signed distance from spatial point to STL model, a reference ball method was put foward based on linear octree.
针对如何快速求取空间点到STL模型表面有符号距离这一问题，提出一种基于线性八叉树的参考球方法。
Analyze the Characteristics of the linear quadtree and linear octree and describe the linear octree encoding based on the decimal system.
分析了线性四叉树、线性八叉树两种数据结构的特点，介绍了一种基于十进制的线性八叉树编码技术。
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.
八叉树不易表达场景的相邻结点，本文设计了邻域查找算法以进行八叉树中相邻结点的查询。
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.
主要讨论用八叉树对三维图形进行处理的特点以及由三维图形到八叉树转换的算法，同时介绍线性八叉树的基本思想。
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.
综合考虑所摄图像序列中包含的几何轮廓信息与光亮度信息，采用立体相交技术和剥离技术，逐步求精地得到三维物体的八叉树表示。
It has infrared images processing, volume intersection technique, 3d representation scheme of an object, and accomplishes reconstruction of 3d plane structure by Octree coding.
该系统包括红外图像的处理技术、三维信息提取的体相交技术、三维形体的表示方法和基于八叉树结构的飞机三维形体重建的实现。
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.
为了应用计算机图形学中高效的3维物体碰撞检查的分离轴理论，对自由曲面进行八叉树建模。
However, the linear octree structure for generating the representation of 3-d objects from three orthogonal views by using the volume intersection technique is dependent on viewpoints.
然而，利用体积交技术由正交三轮廓图生成三维客体的线性八元树表示取决于观察点。
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.
线性八叉树编码是一种有效的表示三维物体的方法。给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
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.
线性八叉树编码是一种有效的表示三维物体的方法。给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
应用推荐