-
opencv学习笔记（中文）
opencv学习笔记（中文）学习opencv已有一段时间，自己的笔记上传下，方便他人
- 2022-04-18 19:15:53下载
- 积分：1
-
KenGraphic
1.功能很强大的数学运算类，
2.算法经过多次优化，速度经过测试
3.包含类别有
点，线，面，圆，球，圆柱，多边形，向量，矩阵运算等多种类-KenGraphic
- 2022-07-27 14:50:52下载
- 积分：1
-
C++ 2005 drawer
C++ 2005抽屉
- 2023-04-09 19:05:05下载
- 积分：1
-
implementation of SURF feature extractor
implementation of SURF feature extractor
- 2022-02-12 12:12:18下载
- 积分：1
-
深度图象的生成 生成圆球的深度图象（摄像机坐标系）和深度图象数据存储；
这是本人的深度图像分析的课程作业，vc编写，包括原代码，可执行程序，以及试验报告。...
深度图象的生成 生成圆球的深度图象（摄像机坐标系）和深度图象数据存储；
这是本人的深度图像分析的课程作业，vc编写，包括原代码，可执行程序，以及试验报告。-depth Image Generation Generation magnificently depth images (camera coordinate system) and the depth of image data storage; This is my depth analysis of the images courses operations, vc preparation, including source code, executables, and the test report.
- 2023-08-07 10:05:04下载
- 积分：1
-
一个关于图形图向生成的软件
一个关于图形图向生成的软件- About graph chart to production software
- 2022-02-09 23:35:35下载
- 积分：1
-
一个图形变换程序
一个图形变换程序-a graphics transformation process
- 2022-12-17 17:20:03下载
- 积分：1
-
颜色HSV空间与RGB空间的相互转换，本程序已经测试可用于彩色图像处理...
颜色HSV空间与RGB空间的相互转换，本程序已经测试可用于彩色图像处理-HSV space and RGB color space conversion, the procedures have been tested can be used for color image processing
- 2023-06-11 13:55:02下载
- 积分：1
-
医学可视化中经典算法――maching Cubes（移动立方体算法）的C++ 程序实现，在学习此算法的时候可以参考次程序。...
医学可视化中经典算法――maching Cubes（移动立方体算法）的C++ 程序实现，在学习此算法的时候可以参考次程序。-The Marching Cubes algorithm is a classical arithmetic in medicinal visualization, this program was impolder in C++ language,you can consult it when you learn the Marching Cubes algorithm .
- 2022-01-25 14:18:38下载
- 积分：1
-
本文讨论了一个随机的
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.-This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum#ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.
- 2022-09-22 09:45:03下载
- 积分：1
