-
导出三维卷生成
应用背景此代码创建一系列的三维体积的球体，立方体，圆柱体，圆锥体，球体的平行六面体，和沙漏。除了描述每个卷的基本方程，进行三维可视化的卷，并保存所有的二维数据量的每一个切片在一个文本文件。所以你可以导出其他任何平台。关键技术一个被我们的MATLAB更难的话题课程是利用数组运算符来实现矩阵的功能一个变量。虽然这是MATLAB的强大功能，这个概念很难理解，因为它不存在于其他编程语言。- 3的功能将显示一个三维一组数据点的绘制。- meshgrid（xgv，ygv，zgv）产生三维坐标系。输出坐标arraysx，Y，网格的vectorsxgv andzcontain副本，ygv，andzgvrespectively。输出阵列的大小由网格向量的长度确定。网格vectorsxgv，ygv，andzgvof lengthm，N，andprespectively，X，Y，andzwill havenrows，mcolumns，andppages。
- 2022-03-29 19:48:28下载
- 积分：1
-
To write a program using the opengl function will be a teapot at the point (100,...
使用opengl函数写一个程序，将一个茶壶在点（100，50，0）处逆时针旋转30度，然后平移到（30，10，0）处，最后顺时针旋转50度，显示时将左上边四分之一裁减去。-To write a program using the opengl function will be a teapot at the point (100,50,0), Office of counter-clockwise rotation of 30 degrees, and then move to flat (30,10,0), Office of the final clockwise 50 degrees, the display will be left reduction to the fourth side.
- 2023-05-05 00:55:02下载
- 积分：1
-
神经网络训练，可参考相应的文章，杜达《模式分类》等
神经网络训练，可参考相应的文章，杜达《模式分类》等
- 2022-02-13 01:49:27下载
- 积分：1
-
一个小办公软件的例子
一个小办公软件的例子-a small example of the office software
- 2022-01-20 22:49:36下载
- 积分：1
-
识别选定图片表情
vc和opencv写的识别选定图片的程序，详细识别步骤-眼--鼻--嘴debug可用
- 2022-07-09 14:14:24下载
- 积分：1
-
BMP位图处理的源代码,非常好用
BMP位图处理的源代码,非常好用-bitmap BMP handling the source code, very handy
- 2022-09-20 00:35:03下载
- 积分：1
-
本程序是在VC++环境下编写的二次样条曲线程序源代码，可直接运行程序，是学习图形学的好帮手。...
本程序是在VC++环境下编写的二次样条曲线程序源代码，可直接运行程序，是学习图形学的好帮手。-This procedure is VC++ Environment prepared quadratic spline curve of source code, can be directly run the program, is a good helper to learn graphics.
- 2022-07-13 12:28:13下载
- 积分：1
-
VB6喷枪演示程序.在一个黑色的背景上随机的＂喷雾＂
VB6喷枪演示程序.在一个黑色的背景上随机的＂喷雾＂-VB6 Lance Demonstration Program. In a black background were the "spray"
- 2022-06-02 13:41:52下载
- 积分：1
-
这是计算机图形学中的对二维图形进行基本几何变换的程序
这是计算机图形学中的对二维图形进行基本几何变换的程序-This is a two-dimensional computer graphics in the graphics program of basic geometric transformations
- 2022-02-18 16:16:44下载
- 积分：1
-
Factorized Graph Matching 分解图匹配，路径追踪优化代价函数
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence
problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem
(QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and
difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision
problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large
pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges.
Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity
matrix; (2) The factorization allows the
- 2022-02-01 17:07:26下载
- 积分：1
