资 源 简 介
Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割―归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割―归并法相当，较好的情况下快于分割―归并法。-Delaunay Triangulation as a major DTM Fall table, with the right to its extensive use. After 20 years of study, which had been generating algorithm is maturing. This paper introduces a Delaunay Triangulation and another set of characteristics, in a brief review and evaluation of the divide-conquer method, point by point insertion method, the supraspinatus Growth Triangle law Shen three main algorithm on the basis of the above algorithm into an advantage in that balanced space and time performance of synthesis algorithm. After tests, under normal circumstances it"s computational speed much faster than the insertion point by point, and the divide-conquer method rather, a better situation faster than divide-conquer method.
文 件 列 表
CQuadDissect
res
Debug
CQuadDissect.clw
ReadMe.txt
CQuadDissect.h
CQuadDissect.cpp
StdAfx.h
StdAfx.cpp
MainFrm.h
MainFrm.cpp
CQuadDissectDoc.h
CQuadDissectDoc.cpp
CQuadDissect.dsw
CQuadDissect.ncb
CQuadDissect.plg
CQuadDissect.dsp
Resource.h
CQuadDissect.aps
CQuadDissect.rc
CQuadDissectView.h
CQuadDissectView.cpp
CQuadDissect.opt
