此代码用来求解建立点的凸闭包多边形，采用凸闭包插入算法建立Delaunay三角网可以用到或参考。-this code to solve the establishment point of closure convex polygon, using convex closure insertion algorithm to establish Delaunay triangulation can be used as reference.

一个高程数据贴上漂亮纹理的例子，左键点击在三角网与纹理图之间切换，而且随着鼠标移动，图形会自动移动。-Elevation data to affix a pretty example of texture, left click with the Nets in the triangular texture map to switch between, and along with mouse, graphics will automatically move.

Delaunay三角网生成，利用离散点生成Delaunay三角网，交互式界面(Delaunay triangulation to generate the use of discrete point generating Delaunay triangulation, interactive interface, intuitive)