-
计算机图形学相关示例代码,比较经典的,看看有好处
计算机图形学相关示例代码,比较经典的,看看有好处-Computer graphics-related sample code, more classic, look good
- 2022-01-26 04:41:25下载
- 积分:1
-
一个完整简单的PYTHON图像处理程序_1
一个完整简单的PYTHON图像处理程序_1-a simple PYTHON has made a complete image-processing program _
- 2022-03-23 05:54:20下载
- 积分:1
-
8。视频预览(预览视频)12 9。视频设置叠加模式(使振动。
8预览视频(预览视频)12 9。视频设置为覆盖模式(启用视频覆盖)12 10。命名捕获文档(命名捕获文件)12
- 2022-09-17 12:05:03下载
- 积分:1
-
用Idl编写的,绝对真实再现了3维变换的最高境界
用Idl编写的,绝对真实再现了3维变换的最高境界-Prepared using idl absolutely true 3-dimensional transform represents the highest state of
- 2022-02-04 19:31:58下载
- 积分:1
-
检测圆形目标的程序,可以在大面积的图象中检测出多个圆形目标...
检测圆形目标的程序,可以在大面积的图象中检测出多个圆形目标-Circular target detection process, you can image a large area detected in more than a circular target
- 2022-05-15 01:36:51下载
- 积分:1
-
图像处理 模板匹配
用模板匹配法找出待分析图片3. 将找到的英文字母按与待分析图片中相同的顺序写入文本文件中...
图像处理 模板匹配
用模板匹配法找出待分析图片3. 将找到的英文字母按与待分析图片中相同的顺序写入文本文件中-Image processing, template matching using template matching method to identify images to be analyzed 3. Will find the English alphabet and to be analyzed by the same order as in the picture into a text file
- 2023-01-06 09:50:03下载
- 积分:1
-
本程序整合了 OSG 大部分的基础功能,程序代码编写采用了模块化思想,有效代码在 1000 行左右,注释比较清晰,对于程序的修改和功能的扩展非常方便。...
本程序整合了 OSG 大部分的基础功能,程序代码编写采用了模块化思想,有效代码在 1000 行左右,注释比较清晰,对于程序的修改和功能的扩展非常方便。-This procedure combines the foundation for most functional OSG, procedures used to prepare the code modular thinking, effective code line in about 1000, the Notes are more well-defined, for the process to modify and extend the very convenient features.
- 2022-01-28 04:06:47下载
- 积分:1
-
这是一个坐标转换的程序代码,根据图象的经纬度来进行转化
这是一个坐标转换的程序代码,根据图象的经纬度来进行转化-This is a coordinate transformation of program code, according to the latitude and longitude to image conversion
- 2022-07-04 09:33:18下载
- 积分: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
-
刚学会做的人物移动行走和碰撞检测
刚学会做的人物移动行走和碰撞检测-People do刚学会mobile walking and Collision Detection
- 2022-06-29 18:29:56下载
- 积分:1