登录
首页 » Visual C++ » OpenGLPvc6.0--contour

OpenGLPvc6.0--contour

于 2013-04-27 发布 文件大小:41KB
0 120
下载积分: 1 下载次数: 5

代码说明:

  利用四叉树算法结合OPENGL生成平面等值线图,使用vc++进行编程。(Quadtree algorithm with OpenGL plane contour map is generated use programming vc++.)

文件列表:

VC%2B%2B6.0基于OpenGL等值线颜色填充图.doc,94208,2013-03-13

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

发表评论

0 个回复

  • 0401-2
    椭圆曲线密码体制及其在电子银行中的应用,对椭圆曲线的加解密应用具有很好参考价值(Elliptic curve cryptography and its application in e-banking, a good reference value of the elliptic curve encryption and decryption application )
    2012-04-01 09:12:53下载
    积分:1
  • FilterTitleOverlay
    FilterTitleOverlay字幕叠加的filter(FilterTitleOverlay subtitles superimposed filter)
    2014-01-23 08:03:52下载
    积分:1
  • liantongbiaoji
    图像处理方面,用VC++实现的连通区域标记的程序。(Image processing, with VC++ implementation of the procedures connected region markers.)
    2011-12-20 16:58:30下载
    积分:1
  • basic
    matlab中许许多多的基础图像处理方法,最适合初学者使用,希望采纳哦(matlab image processing method in the base of many of the most suitable for beginners to use, hope to adopt oh)
    2015-03-18 14:51:43下载
    积分:1
  • GPS-easysuit
    matlab处理GPS数据的学习用代码。共5个部分附带说明书。包括第一部分GPS时间系统、第二部分Rinex文件读取、第三部分接收机的地心地固位置计算、第四部分基于伪距码的基线解算、第五部分双差解算(GPS data processing matlab learning with the code. A total of five parts with manual. GPS time system includes a first portion, a second portion Rinex file read, the third part of the ground EarthFixed receiver position calculation, the fourth part of the pseudo-code based on the baseline solution, the fifth part of the double difference solver)
    2013-09-11 17:22:47下载
    积分:1
  • atl
    VC和MATLAB混合编程 使用MATLAB工具函数计算(VC and hybrid programming using MATLAB tool MATLAB function to calculate)
    2010-06-09 18:29:21下载
    积分:1
  • Imager_SDK_14.12.20086
    Pocket 2003 Imager_SDK_14.12.20086 for software engineereing.
    2014-01-07 17:21:36下载
    积分:1
  • MPU6050-DMP
    MPU6050陀螺仪,代码,技术文档, 测试程序(MPU6050 gyroscope, code, technical documentation, test programs)
    2013-10-06 14:03:59下载
    积分:1
  • Recursive_integer_division
    递归法求解整数划分。 整数划分,是指把一个正整数n写成如下形式: n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
    2014-02-06 14:21:38下载
    积分:1
  • matlabkalman
    kalman的学习资料 很好的东西 一起学习吧(kalman learning materials good stuff)
    2014-10-27 16:01:07下载
    积分:1
  • 696516资源总数
  • 106446会员总数
  • 9今日下载