optical1

三角形判断问题。可用于黑盒测试用例设计。(Triangle judgment. Can be used for black-box test case design.)

对三维融合后的图像进行质量评价，其中包括信息熵、平均梯度、标准差、空间频率、均方根误差、峰值信噪比 (The three-dimensional fusion of the image quality uation, including information entropy, the average gradient, standard deviation, spatial frequency, root mean square error, peak signal to noise ratio)

Qt编写的小程序，主要是编写类似visio的一部分功能(Small program written in Qt，Small program written in Qt)

威布尔分布 多阶段 概率分布密度 概率分布图(NSGA-II is a very famous multi-objective optimization algorithm. I submitted an example previously and wanted to make this submission useful to others by creating it as a function. Even though this function is very specific to benchmark problems, with a little bit more modification this can be adopted for any multi-objective optimization.)

使用MFC创建单文档程序，在界面上画圆，单击可使圆放大、变色(MFC SDI DRAW CIRCLE, CLICK TO INFLATE THE CIRCLE AND CHANGE ITS COLOR)

模拟高斯光束的三维光强分布，以及峰值分布(The three-dimensional intensity distribution of simulated Gauss beam)

一个用来显示Autocad内部数据结构的极佳工具. Autocad2006二次开发人员必备!(used to indicate an internal data structure Autocad an excellent tool. Autocad2006 Secondary Development staff required!)

C# 两条曲线 实时显示 zedgraph(C# two curves displayed in real time)

能够对通达信.lc5文件进行修改，主要是修改分钟数，这样可以在两年多的数据中进行画线处理(Mastery letter. Lc5 file to be modified, modify the number of minutes, so you can draw lines in more than two years of data)

说明：  1． 做一个集成的图形界面的程序，可调用每一次作业子程序。 2． 调用画点的函数，用DDA、中点算法画直线和中点算法及正负法画圆和抛物线。 3． 交互式的二维直线求交：如果存在交点，用实心圆显示交点，并用文字显示其坐标。 4． 用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括自行车行走和绕固定点旋转的自旋转物体动画。） 5． 线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。 6． 两种扫描多边形扫描转换算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法任选一种）； 7． 4连通区域的递归种子填充算法，和扫描线种子填充算法，要求种子点(x,y)可交互输入）。 8． 简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。 9． 交互式Bezier曲线的输入绘制程序实现 (1. So an integrated graphical interface procedures, which call for each operation subroutine. 2. Calling the painting point function, with DDA, the midpoint algorithm painting line and the midpoint algorithm and France Circle and the positive and negative parabola. 3. Interactive 2D linear intersection : If there intersection with a solid circle indicates Nodal and writing to demonstrate its coordinates. 4. Using 2D animation graphics transform algorithms to achieve the specified physical translation, rotation and scaling. (Including walking and cycling around the fixed point of rotating objects from the rotating animation.) 5. Line cutting and polygon clipping algorithm to achieve the animation demo. (Two segments cutting algorithm and H-S-by-side polygon clipping algorithm) polygon clipp)