登录
首页 » C++ » four

four

于 2008-02-12 发布 文件大小:1KB
0 132
下载积分: 1 下载次数: 65

代码说明:

  四叉树递归 此种模型绘制类似米字形的网格。由于整个过程递归调用绘图函数,所以可以根据误差判断绘制DEM的精细程度,从而绘制出不同精细程度的DEM,为解决漫游中数据量较大而引起的画面不流畅现象提供了模型基础。 本文并没有对LOD作研究,只是给出了四叉树的建立和遍历绘图的方法。 (Recursive quadtree rendering such models similar character-meter grid. Recursive calls as a result of the whole process of mapping function, so it can be judged according to the error map of the fine DEM, thus rendering a different degree of precision DEM, for the settlement of roaming in the amount of data arising from the larger screen does not provide a model of fluid based on the phenomenon. This article does not LOD for research, but given quadtree traversal of the establishment and mapping method.)

文件列表:

四叉树递归.cpp

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

发表评论

0 个回复

  • C++ Builder程序员学习第8章
    C++ Builder程序员学习数据结构第8章-Builder programmers learn C data structures Chapter 8
    2022-11-01 07:35:03下载
    积分:1
  • 4.2
    基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法,路径必须经过要求的必经点,且不成环。 该算法采用了一种自适应调整的方法,经过多次迭代,使解收敛。 但只是寻找了一个略优的可行解(每次迭代都基于贪婪算法寻找),不能保证最优解。而且如果图过于稀疏,因为收敛速度过快,可能导致问题无解(收敛于一个局部最优解,没有经过所有点)。 解决相对稠密的图(每个点的平均出入度4以上),表现良好。 备注:里面有一个QT的工程,可以直接打开(源码里没用QT的库)(Weighted Dijkstra and breadth first search based on a shortest path algorithm must point to point to the map, the path must pass through points, and not a ring. This algorithm adopts an adaptive method to adjust, after several iterations, the convergence of solution. But only to find a slightly better feasible solution (each iteration is based on the greedy algorithm to find), can not guarantee the optimal solution. And if the graph is too sparse, because the convergence speed is too fast, it may lead to the problem of no solution (convergence to a local optimal solution, not after all points). To solve the relatively dense graphs (each entry point average above 4), good performance.)
    2016-04-06 11:35:48下载
    积分:1
  • 使用汇编写的二叉树遍历,我用的是按层存储算法,容易理解...
    使用汇编写的二叉树遍历,我用的是按层存储算法,容易理解-was compiled using the binary tree traversal, I used is based on the storage layer algorithm, easy to understand
    2022-04-29 02:03:41下载
    积分:1
  • 哈夫曼压缩编码的例子,真的不是平常的课程设计那么垃圾的东东,还是有价值的...
    哈夫曼压缩编码的例子,真的不是平常的课程设计那么垃圾的东东,还是有价值的-haffman compress
    2022-06-15 09:56:44下载
    积分:1
  • oracle OCI 类封装
    1.oracle OCI 数据类封装 支持linux windows 2.通过封装不同类驱动
    2022-06-20 12:01:26下载
    积分:1
  • 用循环链表解决约瑟夫环问题。对学习循环链表有很大帮助
    用循环链表解决约瑟夫环问题。对学习循环链表有很大帮助-By cyclic list Joseph Central problem to solve. Learning cycle has a great list to help
    2022-06-20 16:38:30下载
    积分:1
  • Kruskal
    Kruskal in Data structure
    2013-10-02 21:20:46下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • 建二叉树
    说明:  分别根据已知给定序列前序序列、中序序列构建对应的二叉树,已知序列的后序序列、中序序列构建对应二叉树(Constructing the corresponding binary tree according to the given sequence order)
    2020-02-14 17:25:10下载
    积分:1
  • sql 语句大全,各种语句都能够查得到
    sql 语句大全,各种语句都能够查得到-sql
    2022-02-03 23:18:14下载
    积分:1
  • 696518资源总数
  • 106235会员总数
  • 12今日下载