Delaunay三角网的生成算法研究.pdfVIP

第 28 卷　第 1 期 测　绘　学　报 . 28, . 1 V o l N o 　1999 年 2 月 A CTA GEODA ET ICA et CA R TO GRA PH ICA S IN ICA Feb. , 1999 D elaunay 三角网的生成算法研究 武晓波　王世新　肖春生 ( 中国科学院遥感应用研究所, 北京, 100101) A new study of D elaunay tr iangulation creation W u X iaobo , W ang Sh ix ing, X iao Chun sheng ( , , , 100101) Institu te of R em ote S ensing A pp lications Ch inese A cad em y of S ciences B eij ing 　 , Abstract A s one of the mo st impo rtant D TM model D elaunay triangulation is w idely app lied in m anifo ld . . fields T h is paper introduces briefly its definition and significant p roperties A fter review ed and assessed sim — , , , p ly to its p revalent generation algo rithm s divide conquer increm ental insertion triangulation grow th th is article p rovides a new upgrade algo rithm —compound algo rithm. T he new algo rithm takes advantages of di . vide conquer and increm ental insertion algo rithm It uses computer resources of tim e and space mo re reason . , ably T h rough test w ith real D EM data its running speed p roves far faster than that of increm ental insertion