Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - Tree
Search - Tree - List
四叉树(lod)实现地形三维可视化的程序,内有代码和数据-quadtree (incomplete) 3D terrain visualization procedures, which have code and data
Date : 2025-12-20 Size : 295kb User : 齐名

用一种基于树形结构的LOD算法来显示的地形,效果很好,学以游戏编程的人可以参考一下.-using a tree structure based on the LOD algorithm of the terrain and the results very good, learn to program the game to make profits.
Date : 2025-12-20 Size : 286kb User : RainMan

用vc编的八查树算法,可以参考下我得做法-Vc made by the eight search tree algorithm, can refer to the next I have to practice
Date : 2025-12-20 Size : 255kb User : 华后生

DL : 0
vrml建树的代码,详细说明建树的过程,及其Vrml实现动作的例子-VRML code contributions, a detailed description of the process done, and VRML examples of action to achieve
Date : 2025-12-20 Size : 124kb User : lixiaodong

用vrmlscript制作的三维场景绿化植树功能源代码及图片,用BS浏览器可查看,在控制台可以直接打印出生成的源代码,生成源代码可直接复制到场景中永久保存,相当于一个可视化的vrml绿化编辑器。-Produced by using three-dimensional scenes vrmlscript greening and tree planting function source code and pictures, with BS browser can view in the console can directly print out the generated source code to generate the source code can be directly copied to the permanent preservation of the scene, which is equivalent to a Visualization of VRML Green editor.
Date : 2025-12-20 Size : 243kb User : 李成

迄今为止见过的最方便的huffman编码,效率很高 一个外国人写的,很具有研究价值 Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1). 2) Set the value of each node to the number of times that its symbol appears in the data stream. 3) Create a Minimum-Heap of N nodes. 4) Add every node whose value is greater than zero to the heap. 5) Extract the best two nodes in the heap. 6) Create a parent node whose children are the two extracted nodes. 7) Add the parent node to the heap. 8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap). 9) Extract the last node in the heap. The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream. The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Date : 2025-12-20 Size : 17kb User : 游弋人生

DL : 0
K-D树源码,不错的空间查找算法,在三维重建和匹配中应用较多!-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
Date : 2025-12-20 Size : 103kb User : yangronghao

实验了基本的场景,包括底面的草,简陋的树的贴图和烟花的效果。-Experiment the basic scene, including the bottom of the grass, tree simple mapping and fireworks effects.
Date : 2025-12-20 Size : 4.65mb User : real

DL : 0
3其中“2.gif”是树的贴图,存储为GIF文件格式。这是因为要使树的最终效果更好;要把图像的背景设置为背景透明,GIF文件格式可以存储一些背景颜色并将其转换成透明性信息,而JPG的格式不能存储透明性信息。-3 of them " 2.gif" is a tree map, storage for the GIF file format. This is because the net effect of the tree to make better to set the background image as the background transparent, GIF file format can store some of the background color and transparency of information into, and the JPG format can not store transparency information.
Date : 2025-12-20 Size : 779kb User : 沈欢

一个高效的k-d tree实现,可以广泛的应用与图形图像处理。-K nearest neighbor search based on KD-tree
Date : 2025-12-20 Size : 24kb User : 南亮亮

DL : 0
人体骨骼动画,BVH格式文件。 是一种树形层次结构表示的人体骨骼-Human skeletal animation, BVH format. Is a tree-like hierarchical structure of the human skeleton
Date : 2025-12-20 Size : 4.25mb User : 陈金福

DL : 0
delphi实现的bsp树,可运行,代码详细-delphi implementation bsp tree, you can run the code in detail
Date : 2025-12-20 Size : 630kb User : hanxiaoye

DL : 0
XNA植物建模算法,其中LTreeDemo可以直接控制树的生成,LeafTool用于创建叶子的texture-XNA tree modeling algorithm,where LTreeDemo is for modeling and preview trees, LeafTool is for creating texture of leaf.
Date : 2025-12-20 Size : 2.22mb User : 郅刚

3D-style drawing with vb6! Very impressive work!-3D-style drawing with vb6! Very impressive work!
Date : 2025-12-20 Size : 161kb User : coolzjai

3D圣诞节 基于3DS OPENGL 即可学习又可趁圣诞节到来送人-3D Christmas 3DS OPENGL-based learning can also take advantage of Christmas can come give as gifts
Date : 2025-12-20 Size : 4.99mb User : mumu

DL : 0
虚拟的树 是属于比较复杂的结构了 希望大家下来-Virtual tree is on a more complex structure of the hope that we look down
Date : 2025-12-20 Size : 30kb User : zeng

quad tree 四叉树地形lod论文英文原版-quad tree lod
Date : 2025-12-20 Size : 2.01mb User : wt

光线追踪的cuda程序,基于cuda实现,大大加速了速度。-Cuda ray tracing program, based on cuda implementation, greatly accelerating the speed.
Date : 2025-12-20 Size : 12kb User : wangpichao

DL : 0
these file is vrml file with file extension wrl it shows 3d wrl tree object
Date : 2025-12-20 Size : 1.59mb User : wondwossen

场景检测算法之一:bsp tree的实现代码-the source code to implement bsp tree algorithm
Date : 2025-12-20 Size : 34kb User : 孙晟轩
« 12 »
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.