期刊文献+

DELAUNAY三角网的算法详述及其应用发展前景 被引量:65

The expatiation of delaunay algorithms and a promising direction in application
下载PDF
导出
摘要 在GIS应用领域中,Delaunay三角网通常被用于生成不规则三角网(TIN)模型,并用于描述地表形态。本文详细叙述改进了的现有国内外Delaunay三角网的生成算法,并发现Delaunay三角网不但在描述地表形态上有很大的优势,而且在图像处理、模式识别领域也将有很大的优势。而且国内外已经有部分学者专家作出一定的尝试,并且取得了较好的效果。所以作者进一步提出将Delaunay三角网用于地图符号信息识别,将是一个很有发展前景的应用方向。 The Delaunay triangulation is commonly used to generate triangulated irregular net work(TIN) models for a best description of the surface morphology in a variety of applications in geographic information systems (GIS). This paper introduces, in details, the current international improved algorithms for generating Delaunay triangulations. And it is found that the Delaunay triangulation has great many advantages not only in description of surface morphology but also in the field of image processing and pattern recognition. Furthermore , some academicians and experts have explored in this direction and have got a number of satisfacfory results. So the author puts forward that Delaunay triangulation's application on map symbols information recognition will be a promising application direction.
出处 《测绘科学》 CSCD 2004年第6期68-71,共4页 Science of Surveying and Mapping
关键词 Delaunay改进算法 TIN 地图模式识别 improved Delaunay algorithm TIN MPR
  • 相关文献

参考文献14

  • 1武晓波,王世新,肖春生.Delaunay三角网的生成算法研究[J].测绘学报,1999,28(1):28-35. 被引量:349
  • 2[2]Lawson C L. Generation of a triangular grid with application to contour plotting[A]. In: Technical Memorandum [C],Institute of Technology, Jet Pollution Laboratory, California,1972:299.
  • 3[3]Lee D T and Schacher B J. Two algorithms for constructing a delaunay triangulation[J]. International Journal of Computer and Information Sciences, 1980,(9 ): 219-242.
  • 4[4]Dawyer R A.A fast divide-and-conquer algorithm for constructing Delaunay triangulations[J].Algorithmica, 1987, (2): 137-151.
  • 5徐青,常歌,杨力.基于自适应分块的TIN三角网建立算法[J].中国图象图形学报(A辑),2000,5(6):461-465. 被引量:57
  • 6[6]Macedonio G and Pareschi M T. An algorithm for the triangulation of arbitrarily distributed points: applications to volume estimate and terrain fitting[J]. Computers & Geosciences, 1991, 17: 859-874.
  • 7[7]Brassel K E and Reif D. Procedure to generate thissen polygons[J]. Geographical Analysis, 1979,11:289-303.
  • 8[8]Mc Cullagh M J and Ross C G T.Delaunay triangulation of a random data set for is arithmic mapping[J]. The Cartographic Journal,1980, 17:93-99.
  • 9凌海滨,吴兵.改进的自连接Delaunay三角网生成算法[J].计算机应用,1999,19(12):10-12. 被引量:29
  • 10[10]Mirante A and WeinGarten N. The radical sweep algorithm for constructing triangulated irregular networks[J]. IEEE. Computer Graphics and application, 1982:11-21.

二级参考文献18

共引文献447

同被引文献498

引证文献65

二级引证文献286

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部