八叉树

网络释义

1.
Octree
八叉树（Octree）的定义是：若不为空树的话，树中任一节点的子节点恰好只会有八个，或零个，也就是子节点不会有0与8以 …
baike.baidu.com|基于260个网页
2.
OctTree
八叉树 (Octtree) 森林 k-d树 栈 双端队列 多维数组 串 后缀树 剖析树 线段树 树状数组 字典树(Trie) 跳表(Skip list)
www.nocow.cn|基于58个网页
3.
Octree-based
2.6.3 八叉树(Octree-based)方法
book.hzu.edu.cn|基于2个网页
4.
octreeOCX
翻译资源百分百-项目评估与分析用语英语翻译（1） ... 散列字元 octothorpe 八叉树 octreeOCX 程式 OCX ...
www.fy100.com|基于 1 个网页
5.
Binary Volumetric Octree BVO
...方法，包括步骤： 将三维物体原始数据转换成二进制的八叉树(Binary Volumetric Octree BVO)格式，其中颜色被赋予对应于 …
patent-cn.com|基于 1 个网页

例句

释义:
全部全部,OctreeOctree,OctTreeOctTree,Octree-basedOctree-based
类别:全部全部,口语口语,书面语书面语,标题标题,技术技术
来源:全部全部,字典字典,网络网络
难度:全部全部,简单简单,中等中等,难难
1.
Now it isn't hard to see that this cube can be divided into eight smaller cubes , hence the name octree . Take a look at this picture.
现在不难看出这个立方体可以被八等分为八个小些的立方体，所以才叫八叉树。看看这张图。
pk4.xyz
2.
In this paper, octree encoding is described and used for storage and indexing of orebody information.
本文介绍一种八叉树编码，并将它应用于矿体信息的存储和检索，取得了明显的效果。
www.magsci.org
3.
If you have a correct definition of you cube Node it is very easy to create an octree recursively.
如果你正确的定义了你的立方体节点，那么递归地创建一个八叉树是很容易的。
dictsearch.appspot.com
4.
The basic process of tetrahedral octree spatial decomposition for using directly in finite element analysis is described.
然后在此基础上详细论述了正四面体八叉树法划分空间、直接生成四面体网络单元的基本过程。
dictsearch.appspot.com
5.
The index method based on octree and B tree is used to organize the point cloud data.
采用基于八叉树与B树相结合的方法来组织三维点云数据。
www.fabiao.net
6.
You could also apply the octree to many other things.
你可以应用八叉树到很多别的地方。
blog.csdn.net
7.
The filtered data are divided into subdomains using an adaptive octree subdivision method.
然后，用自适应的八叉树空间划分方法将降噪后的采样点数据分成小的子域。
dictsearch.appspot.com
8.
The implementation of an octree is very straight forward. I haven't done it myself yet, but I will soon.
实现一个八叉树是很简单明了的事情，我还没有自己做过，但是我不久会做的。
blog.csdn.net
9.
In this paper, an algorithm is proposed for the accelerated rendering of volume on linear octrees basis.
提出了基于线性八叉树的加速体绘制算法。
kns50.chkd.cnki.net
10.
The subdivision algorithm based on tight octree is proposed, whose efficiency is proved in the virtual reality.
针对上述问题，论文提出了基于紧凑八叉树的剖分方法。该方法在虚拟现实场景中表现了较好的效果。
www.digimanusci.com