登录
首页 » Visual C++ » MyKD Tree

MyKD Tree

于 2015-06-24 发布 文件大小:6410KB
0 131
下载积分: 1 下载次数: 21

代码说明:

  KD树算法,能够实现对点云数据进行压缩,非常简单,适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)

文件列表:

MyKD_Tree
.........\Debug
.........\.....\MyKD_Tree.exe,130048,2015-04-06
.........\.....\MyKD_Tree.ilk,651284,2015-04-06
.........\.....\MyKD_Tree.pdb,1420288,2015-04-06
.........\ipch
.........\....\mykd_tree-3de721
.........\....\................\mykd_tree-8f3805b0.ipch,15532032,2015-04-06
.........\MyKD_Tree
.........\.........\Debug
.........\.........\.....\CL.read.1.tlog,17154,2015-04-06
.........\.........\.....\CL.write.1.tlog,1382,2015-04-06
.........\.........\.....\link-cvtres.read.1.tlog,2,2015-04-06
.........\.........\.....\link-cvtres.write.1.tlog,2,2015-04-06
.........\.........\.....\link.4692-cvtres.read.1.tlog,2,2015-04-06
.........\.........\.....\link.4692-cvtres.write.1.tlog,2,2015-04-06
.........\.........\.....\link.4692.read.1.tlog,2,2015-04-06
.........\.........\.....\link.4692.write.1.tlog,2,2015-04-06
.........\.........\.....\link.5936-cvtres.read.1.tlog,2,2015-04-06
.........\.........\.....\link.5936-cvtres.write.1.tlog,2,2015-04-06
.........\.........\.....\link.5936.read.1.tlog,2,2015-04-06
.........\.........\.....\link.5936.write.1.tlog,2,2015-04-06
.........\.........\.....\link.6140-cvtres.read.1.tlog,2,2015-04-06
.........\.........\.....\link.6140-cvtres.write.1.tlog,2,2015-04-06
.........\.........\.....\link.6140.read.1.tlog,2,2015-04-06
.........\.........\.....\link.6140.write.1.tlog,2,2015-04-06
.........\.........\.....\link.6720-cvtres.read.1.tlog,2,2015-04-06
.........\.........\.....\link.6720-cvtres.write.1.tlog,2,2015-04-06
.........\.........\.....\link.6720.read.1.tlog,2,2015-04-06
.........\.........\.....\link.6720.write.1.tlog,2,2015-04-06
.........\.........\.....\link.8448-cvtres.read.1.tlog,2,2015-04-06
.........\.........\.....\link.8448-cvtres.write.1.tlog,2,2015-04-06
.........\.........\.....\link.8448.read.1.tlog,2,2015-04-06
.........\.........\.....\link.8448.write.1.tlog,2,2015-04-06
.........\.........\.....\link.read.1.tlog,4088,2015-04-06
.........\.........\.....\link.write.1.tlog,1444,2015-04-06
.........\.........\.....\mt.read.1.tlog,486,2015-04-06
.........\.........\.....\mt.write.1.tlog,486,2015-04-06
.........\.........\.....\MyKD_Tree.Build.CppClean.log,5257,2015-04-06
.........\.........\.....\MyKD_Tree.exe.embed.manifest,406,2015-04-06
.........\.........\.....\MyKD_Tree.exe.embed.manifest.res,472,2015-04-06
.........\.........\.....\MyKD_Tree.exe.intermediate.manifest,381,2015-04-06
.........\.........\.....\MyKD_Tree.lastbuildstate,98,2015-04-06
.........\.........\.....\MyKD_Tree.log,2667,2015-04-06
.........\.........\.....\MyKD_Tree.obj,568894,2015-04-06
.........\.........\.....\MyKD_Tree.vcxprojResolveAssemblyReference.cache,713,2015-04-06
.........\.........\.....\MyKD_Tree.write.1.tlog,0,2015-04-06
.........\.........\.....\MyKD_Tree_manifest.rc,208,2015-04-06
.........\.........\.....\rc.read.1.tlog,458,2015-04-06
.........\.........\.....\rc.write.1.tlog,466,2015-04-06
.........\.........\.....\stdafx.obj,44938,2015-04-06
.........\.........\.....\vc100.idb,396288,2015-04-06
.........\.........\.....\vc100.pdb,421888,2015-04-06
.........\.........\Kd_Node.cpp,47,2015-04-04
.........\.........\Kd_Node.h,659,2015-04-04
.........\.........\Kd_Tree.cpp,116,2015-04-04
.........\.........\Kd_Tree.h,6249,2015-04-06
.........\.........\myfunctional.h,1769,2015-04-04
.........\.........\MyKD_Tree.cpp,1378,2015-04-06
.........\.........\MyKD_Tree.vcxproj,4453,2015-04-04
.........\.........\MyKD_Tree.vcxproj.filters,1496,2015-04-04
.........\.........\MyKD_Tree.vcxproj.user,143,2015-04-04
.........\.........\ReadMe.txt,1567,2015-04-04
.........\.........\stdafx.cpp,214,2015-04-04
.........\.........\stdafx.h,252,2015-04-04
.........\.........\targetver.h,236,2015-04-04
.........\MyKD_Tree.sdf,9981952,2015-04-07
.........\MyKD_Tree.sln,894,2015-04-04

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • DouglasPeucker
    道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)
    2011-08-28 19:04:29下载
    积分:1
  • c++
    一款可以排序的小程序,希望大家可以看一下(A sort of small program, I hope you can look at it)
    2017-12-13 20:06:55下载
    积分:1
  • dijkstra
    dijkstra算法,用于寻找已建立图的最短路径,是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)
    2007-07-15 14:14:48下载
    积分:1
  • listnode
    C++中,对链表的增删改查的基本使用,值得学习(C++, on the list of CRUD basic use, it is worth learning)
    2015-08-05 17:57:12下载
    积分:1
  • jiaotong
    用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)
    2013-03-23 13:06:49下载
    积分:1
  • work1
    讲解了循环单链表的建立,以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)
    2010-10-03 11:00:45下载
    积分:1
  • Subset
    说明:  子集和数问题.rar,用C++写的,可以运行(Subset of several problems. Rar, written in C++, you can run)
    2010-04-16 17:42:12下载
    积分:1
  • B_Tree
    用控制台实现了经典的数据结构B树,可以通过测试文件.txt加载已有的B树,有插入,删除,查找的功能,加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)
    2020-10-18 17:47:26下载
    积分:1
  • LINK
    建立链表的算法: 新节点链入表尾建立链表: 动态分配第一个节点变量; 用指针head 妥善保存链表第一个节点的地址值; 依次动态分配一个新节点变量; 将上一个节点的指针域指向新生成的节点; 循环3),4)步骤,直到所有节点均连入链表; 将最后一个节点的指针域赋值为0; (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )
    2015-01-05 16:03:48下载
    积分:1
  • chess
    在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)
    2009-06-01 11:21:39下载
    积分:1
  • 696518资源总数
  • 104349会员总数
  • 32今日下载