搜索资源列表
四分树的穷举
- 使用VC为编程语言,结合数据结构二叉树的概念,新编算法进行四分树的穷举。-VC to use programming language, combine the binary tree data structure concept, a new edition of the tree algorithm quarter of exhaustive.
QuadTree
- 实现了地形图像等的四叉树分层,根据图像的梯度和稠密分布进行分层处理。-Realized images of the terrain quadtree hierarchical, according to the image gradient and the dense distribution of slicing.
quadtree_imageseg
- 在matlab环境下对图像进行四叉树分解,在此基础上对图像进行分析-In the matlab environment, an image quad-tree decomposition, in this based on image analysis
dyqfenxing
- 关于分形压缩的资料。采用的算法是四叉树,很好。有编程基础的能看懂。-Fractal compression on the data. Algorithm is used in four-tree, very good. A programming foundation can read.
qur_tree
- 四叉树分割图像中的点,左键点击 右键分割-Quadtree segmentation of the image point, left click the right split
sichashu
- 四叉树程序,图像处理,要做这个的可以-Quadtree procedures, image processing, that can do this look
LOD
- 实现LOD地形的基本类资源。包括了平截头体类和四叉树和地形类,-LOD terrain to achieve the basic categories of resources. Including a truncated cone body type and quad trees and terrain type,
wei
- 对数据建立基于四叉树的索引,并使用skyline方法剪枝,实现top-k查询。-Data to establish an index based on quadtree and uses the method of pruning skyline, to achieve top-k query.
qutree
- 实现四叉树的建立,包括遍历,删除、增加节点等函数-To achieve the establishment of quadtree, including the traverse, delete, add nodes, and other functions
zero_tree
- 该文提出的改进的算法是针对图像压缩编码的,针对四叉树,提出的方案产生了客观和特殊结构的二进制编码。-This paper presents an improved algorithm for image coding, quadtree for the proposed programs have the objective and the special structure of the binary encoding.
Algorithm-QuadTree-0.1.tar
- 对四叉树算法的实现. 对四叉树算法的实现. 对四叉树算法的实现. 对四叉树算法的实现.-On the quadtree algorithm. On the quadtree algorithm. On the quadtree algorithm. On the quadtree algorithm. On the quadtree algorithm. On the quadtree algorithm. On the quadtree algorithm.
3dGIS-Query-Algorithm
- 三维地理信息系统空间数据库具有数据量大、 空间实体关系复杂、 空间操作计算量大等特点。为了提高检索 效率 ,必须建立高效的空间索引机制。八叉树空间索引是对二维 GIS中四叉树索引进行扩展的一种三维空间数据结构 , 具有思路简单、 容易理解和实现、 查询速度快的优点。本文首先阐述了线性八叉树空间索引的原理 ,然后重点介绍了线性 八叉树空间索引的建立和查询算法。-In the 3D GIS database , there is a large quantity of data , sp
sichashu
- 如果把地图分成块,只筛选范围覆盖的块中的单位,这样就可以减少很多不必要的筛选。四叉树可以有效解决这个问题。 树的每一层都把地图划分四块,根据地图尺寸来决定树的层数,层数越大划分越细。 当需要对某一范围的单位筛选时,只需要定位到与范围相交的树区域,再对其区域内的对象筛选即可。(If you map the map into blocks, you filter only the units in the block covered by the range, thus reducing
四叉树
- 自顶向下(top-down)的分割方法:按常规四叉树的方法进行,直接生成M码 ? 从底向上(down-top)的合并方法: – 首先按M码的升序排列方式依次检查四个相邻M码对应的属性值 ? 如果相同,合并为一个大块 ? 否则,储四个格网的参数值(M码、深度、属性值) – 第一轮合并完成后,依次检查四个大块的值(此时, 仅需检查每个大块中的第一个值) ? 若其中有一个值不同或某子块已存储 ? 则不作合并而记盘 – 通过上述方法,到没有能够合并的子块为止(The top-down (top-dow
Quadtree coding
- 采用四叉树编码进行二值图的压缩,四叉树编码方法是目前图象处理和计算机图形学中的一种有效方法。(Quadtree coding is currently a valuable method in image processing and computer graphics,this code is about binary image compression.)
Quadtree decoding
- 与四叉树编码一体,是解压过程。采用十进制Morton码进行解压,程序附有注释,适合学习。程序包括四叉树编码及解码的。(Quadtree decoding,a process of unpacking,includes Decimal Morton code.The program is annotated in detail.)
二叉树的四种遍历方式与层序创建
- 本例程实现对于二叉树的四种遍历方式,先序,中序,后序,层序四种遍历(This routine implements four traversing methods for two forked trees, the first order, the middle order, the rear order and the sequence of four ergodicity.)
二叉树
- 建立二叉树,用四种方法遍历,求二叉树的树高及结点总权,并且能输入一个结点求其父结点(The two forked tree is required to be traversed by four methods, and the height of the two forked tree and the total weight of the node are calculated, and a node can be entered to find the parent node of the
tree
- 以图像灰度为依据,对图像进行四叉树分解。(Quadtree decomposition of images)
基于四叉树的加权聚焦多聚焦图像融合
- 基于四叉树的曝光图像融合。图像融合 matlab语言(Exposure image fusion based on quadtree. Image fusion matlab)