-
打开折叠的flash，用鼠标点击并拖动画面，浏览全景效果，可以通过滚轮实现远近距离调整.用flash做的可以发源文件...
打开折叠的flash，用鼠标点击并拖动画面，浏览全景效果，可以通过滚轮实现远近距离调整.用flash做的可以发源文件-Member Download time you upload you can download the source code for the number of
- 2022-02-01 21:48:22下载
- 积分：1
-
曲面和曲线造型,Bezier曲面造型源代码
曲面和曲线造型,Bezier曲面造型源代码-curve and surface modeling, surface modeling Bezier source code
- 2022-11-16 05:20:02下载
- 积分：1
-
直方图
直方图修正-彩色变换算法源代码-that histogram-color algorithm source code
- 2022-10-27 07:40:03下载
- 积分：1
-
本程序来显示项目EffectShowcdib的特技显示功能．
本程序来显示项目EffectShowcdib的特技显示功能．-the procedures to show that the project EffectShowcdib stunts display.
- 2022-02-01 09:09:20下载
- 积分：1
-
This is a book on face detection and location of the code, you can run, and they...
这是一本书上的人脸检测与定位的代码，可以运行，希望对大家有帮助-This is a book on face detection and location of the code, you can run, and they hope to help everyone
- 2023-04-12 07:50:04下载
- 积分：1
-
通过对最新提出的保罗中提琴房本文的目的
本文的目的是借助Paul Viola最新提出的实时特征检测的技术，实现一个能够进行快速人脸检测的系统。并且通过训练，得到尽可能优化的分类器构造参数，从而获得具有高检测速度和检测正确率的人脸检测系统。-The purpose of this paper by drawing on the latest proposed by Paul Viola real-time feature detection technology, to realize a fast face detection system. Through training, to be as much as possible to optimize the classifier structure parameters to obtain a high detection speed and detection rate of correct face detection system.
- 2022-07-25 23:22:56下载
- 积分：1
-
delphi画正弦曲线，抛砖引玉，发挥后可完成绘图的一些功能
delphi画正弦曲线，抛砖引玉，发挥后可完成绘图的一些功能-delphi painting sine curve, something to play after the completion of some functional mapping
- 2022-01-26 05:54:41下载
- 积分：1
-
一个用C++读取 jpg&bmp 实例程序，非常实用，适合初学者
一个用C++读取 jpg&bmp 实例程序，非常实用，适合初学者-C++ jpg&bmp 读取
- 2022-07-28 04:11:42下载
- 积分：1
-
一个老外写的车削数控仿真程序，有g代码编辑的
一个老外写的车削数控仿真程序，有g代码编辑的-a foreigner was turning the NC simulation program, code editors g
- 2022-05-24 19:16:38下载
- 积分：1
-
Polygon clipping is one of those humble tasks computers do all the time. It s a...
Polygon clipping is one of those humble tasks computers do all the time. It s a basic operation in creating graphic output of all kinds. There are several well-known polygon clipping algorithms, each having its strengths and weaknesses. The oldest one (from 1974) is called the Sutherland-Hodgman algorithm. In its basic form, it is relatively simple. It is also very efficient in two important cases, one being when the polygon is completely inside the boundaries, and the other when it s completely outside.
- 2022-09-16 13:35:03下载
- 积分：1
