搜索资源列表
37
- 对3D数据运用gpu实现八叉树，完成分割并进行渲染。
vc_octree
- 一个vc编的八叉树算法，八叉树常用于3维图形的之间的干涉问题，
Octtree_0_1_2b
- XNA中的松散八叉树(Loose octree)实现-XNA in loose octree (Loose octree) to achieve
Octree
- 八叉树场景管理，有详细的代码，且可读取3ds文件-octree
octree
- 八叉树算法的简单源代码，vc++的运行环境-Simple octree algorithm source code, vc++ runtime environment
Octree
- java3D实现碰撞检测时的八叉树创建，并提供AABB碰撞检测算法-java3D Octree
3Dsuanfa
- c++中的数值算法 Bsp分割算法简述.地形碰撞检测方法，地形渲染的动态LOD四叉树算法详细实现.高级碰撞检测技术.四叉树和八叉树的剔出选择.图片镂空算法集合-c++ in the numerical algorithm outlined Bsp segmentation algorithm. terrain collision detection methods, dynamic LOD terrain rendering algorithm in detail quadtree achiev
octree
- 八叉树代码,包括自适应建立结构，编码，收索-octree，bu hui yingyu ,niaoyu
Ba-Ca-SHU_cpp
- VC++2008和OPENGL实现八叉树-VC++2008 and OPENGL achieve eight cha tree
3DModeling
- 这是计算机图动画中关于三维实体造型内容较详细的讲解，包含体素构造法、八叉树、边界表示法等常用的方法。-This is a computer graphics animated three-dimensional solid modeling on the content of a more detailed explanation, including the construction method for voxel, octree, boundary representation and o
QuadTree
- 八叉树编程，学习八叉树的很好资料，代码有详细的注释。-The Octree programming, learning octree good code detailed notes.
OctreeGPU
- 基于GPU和Octree的3D图形程序，能够实现对3ds模型数据的八叉树管理与渲染，带图形交互功能。-Based on GPU and Octree, managing and rendering 3ds model with Octree and OpenGL, with GUI interaction.
terrain
- 演示地形绘制与漫游，取自OGRE例子，地形管理器会自动应用八叉树分割来管理地形。-Demo terrain rendering and roaming, from OGRE example, terrain Manager automatically applied octree division to manage the terrain.
Octree-Textures-on-the-GPU
- 基于GPU的体积纹理的八叉树实现，是一种高效的使用体积纹理的方式-Octree Textures on the GPU
IsoOctree
- 八叉树实现ISO surface提取的算法，在三维模型建模技术中应用非常广泛-algorithm for extract iso-surface with octree from point cloud, it has been widely used 3D modeling technique in CG
octree-based-codes
- 该程序介绍了有关八叉树编码的基本编程知识，对于初级学者易懂易学。-This program introduces the octree encoding basic programming knowledge, which ishelpful for junior scholars to understand.
octree_search
- 八叉树（Octree）的定义是：若不为空树的话，树中任一节点的子节点恰好只会有八个，或零个，也就是子节点不会有0与8以外的数目。-Definition octree (Octree) is: If the tree is empty, then any tree node s children will have exactly eight, or zero, that is, the number of child nodes 0 and 8 will not have outside.
Octree.08.03.2008
- 八叉树代码，实现最近点查找，内包含点云实例-Octree code to find the nearest point to achieve, and contains the point cloud instances
source
- 点云数据八叉树搜索方法，为点云数据处理提供基础-Point cloud data octree search method to point cloud data processing provides the basis
BuildOctree
- 为点云数据建立，八叉树结构。可用于点云配准、识别、重建。(Building octree structure for point cloud data)