求凸多边形最优三角剖分。用动态规划问题有效解决该问题。多边形是平面上一条分段线形封闭曲线。-Optimal convex polygon triangulation. Dynamic programming problem with an effective solution to the problem. Sub-polygon is a plane closed curve linear.

在VC++编程环境下 实现绘制波形图动态图-In VC++ programming environment to achieve the waveform plots dynamic map

在VC++编程环境下 实现绘制波形图动态图-In VC++ programming environment to achieve the waveform plots dynamic map