摘要
基于对Delaunay三角网生成算法的研究,在目前较为优秀的合成算法的基础上进行改进。首先改进了凸壳的生成算法,通过利用坐标的最大(小)值所构成的4个点来构建凸壳,达到简化凸壳的生成过程的效果;其次改进了三角形快速定位算法,利用向量间的位置关系来判断点与三角形的位置关系。改进后的算法不仅继承原算法兼顾空间和时间的性能,且执行效率有明显提高,有效的缓解了计算机处理能力无法满足复杂的地形表示之间的矛盾。
Due to the complex terrain,and the computer’s processing power is limited,it is unable to achieve the effect of a fast display, after study on algorithm of Delaunay triangulation generation,this article improves the compound algorithm,first of all,it improves algorithm for the convex hull,through four points of the maximum and rninmum values of coordinates a convex hull is built,it simplifies the effect of the generation process, improves fast location of the triangle algorithm,it uses the location relationship between the vectors to determine the location relationship between point and triangulars.The experiments show that the improved algorithm not only inherites capability of original algorithm which take both time and space into account,but becomes more effective,effectively mitigates the contradiction between the limited computer processing capacity and complex geographical terrain data representation.
出处
《长江大学学报（自然科学版）》
CAS
2011年第1期83-85,281,共3页
Journal of Yangtze University(Natural Science Edition)
