凸壳算法，散点成三维体的方法，该方法从洋鬼子那得来的。-convex hull algorithm, scattered dots on the three-dimensional method from the foreign devils that comes from.

三角网剖分 将平面数据点进行三角剖分 快速构建delaunay三角网-delaunay triangulation which can triangulate the dots on the plane

结合图论的知识并用C++语法知识实现的解决各个城市之间最短距离问题，它很好地结合了找出图上任意两个点之间最短距离及路线的Dijstra 算法。-we combine the technology of the map with the knowledge of C++ to find the shortest distance of the two spots.It perfectly take the advantage of the algorithm of Dijstra,which is