Search - vc p - CodeBus

Search - vc p - List

[OpenGL program] OpenGL 椭圆绘制 DL : 0

就是用OpenGL在VC上写的绘制椭圆的算法

是中点方法

Date : 2008-11-02 Size : 214.62kb User : askry31

[OpenGL program] mdi_opengl DL : 21

opengl vc单文档框架………………

Date : 2008-12-27 Size : 6.73mb User : liusdu

[OpenGL program] 两轴联动数控系统程序开发 DL : 3

利用VC++结合OpenGL，对两轴联动数控系统的运动过程进行模拟和仿真，值得参考！

Date : 2009-01-15 Size : 684.86kb User : denisann

[OpenGL program] VC结合OpenGL绘制效果图 DL : 0

利用visual c++开发OpenGL绘制三维效果图在此利用OpenGl辅助库函数绘制球体并添加鼠标操作旋转球体以及背景物体等等的颜色改变处-use visual development OpenGL 3D map drawn in the use of library functions OpenGl assisted mapping ball and add mouse operation rotating spherical object and the background color changes etc. Department
Date : 2025-12-20 Size : 54kb User : 张三

[OpenGL program] pgmdisplay DL : 0

OpenGL的PGM格式显示，对OPENGL初学者有帮助-OpenGL渭脛PGM 赂帽脢陆脧脭脢戮拢卢露脭OPENGL 鲁玫脩搂脮脽脫脨掳茂脰煤
Date : 2025-12-20 Size : 2kb User : 陈主机

[OpenGL program] NewLight DL : 0

定位光源、定向光源及聚光灯参数设置，在VC++中利用OpenGL编写-Positioning light sources, directional light source and spotlight parameter settings, in VC++ Prepared to make use of OpenGL
Date : 2025-12-20 Size : 1.97mb User : coral

[OpenGL program] OpenGLtexture DL : 0

opengl是一个开放的三维图形软件包，而VC是目前主要的opengl开发工具。本文简要介绍了opengl的纹理贴图技术及其在VC中的基本操作步骤。并通过最后的实例验证了纹理贴图技术在绘制真实感图形中的必要性。-opengl is an open three-dimensional graphics package, and the VC is the main development tools opengl. This paper briefly introduces the opengl texture mapping technology and its application in VC in the basic steps. And adoption of the final example of the texture mapping technology in the mapping of the need for realistic images.
Date : 2025-12-20 Size : 196kb User : wuli

[OpenGL program] Delaunay DL : 0

Delaunay三角剖分算法 . 一个非常强劲的VC编的Delaunay三角网生成算法，对您学习VC++或GIS的学习都有很好的帮助作用-In mathematics, and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation they tend to avoid skinny triangles. The triangulation was invented by Boris Delaunay in 1934 [1]. Based on Delaunay s definition[1], the circumcircle of a triangle formed by three points from the original point set is empty if it does not contain vertices other than the three that define it (other points are permitted only on the very perimeter, not inside). The Delaunay condition states that a triangle net is a Delaunay triangulation if all the circumcircles of all the triangles in the net are empty. This is the original definition for two-dimensional spaces. It is possible to use it in three-dimensional spaces by using a circumscribed sphere in place of the circumcircl
Date : 2025-12-20 Size : 36kb User : yulin