期刊文献+

约束性Delaunay三角网下线状要素形态描述研究 被引量:1

Description of linear features under restricted Delaunay triangulation
在线阅读 下载PDF
导出
摘要 以Delaunay三角网为基础,本文形成了用于分析线状要素形态结构的一种约束性三角网,在该三角网中定义了叶、杆、叶叉、间叉、主叉、毛细根、叶枝、间枝、主枝等一系列组件,规定三角单元在内邻接下才具有连通关系,建立了三角单元的树型数据模型,该模型可识别基本弯曲、各层次的复合弯曲,并能体现弯曲的套和关系及复合层次,最后对弯曲形态进行了定义与量化描述。理论分析与实验表明,所提模型与方法逻辑严密,有助于对在GIS平台下线状要素形态分析、自动制图综合及相关问题的探讨。 Based on Delaunay triangulation of linear features,the paper formed a kind of restricted triangulation,defined a set of components in the structure,and constructed a tree-form data model.The model could identify the bents of linear features.Moreover,it could express combinational relation of bents.At last,the paper described the shapes of bents quantitively.The analysis and experiments showed that the model and the method were logically correct. They had a basic significance for liner features morphological analysis and automatic cartographic generalization under GIS.
出处 《测绘科学》 CSCD 北大核心 2007年第5期161-162,共2页 Science of Surveying and Mapping
基金 国土资源部农用地分等定级与估价研究(2004889)
关键词 地理信息系统 线状要素 地图制图综合 DELAUNAY三角网 geographic information system linear features delaunay triangulation
  • 相关文献

参考文献7

  • 1Ferley E, Attali D. Skeletal reco-nstruction of branching shapes. Computer Graphics [ J ]. Forum, 1997, 16: 283 -293.
  • 2Jones C, Ware J M. Ma Pgeneralizat-ion with triangulated data structure [ J ]. Cartographical and Geographical informat-ion system, 1995, 22: 313-317.
  • 3Muller J C. The removal of spatial co-nflicts in line generalization [ J]. Cartogra-phical and Geographical information system, 1990, 17: 49-141.
  • 4Wang Z, Muller J C. line generaliz-ation based on analysis of shape - characteristics [ J ]. Cartographical and Geograph-ical information system, 1999, 26: 253-270.
  • 5Vander Poorten PM. Customisable Line generalization using Delaunay triangulation [ C ] //Proceeding of the 19^th ICA ConferenceOttawa: International Cartogra-phical Congress. section. CD-Rom
  • 6Visvalingam M, Whyatt J D. Line generalization by repeated elimination of points [ C ] //Cartographical Journal. 30 : 46-51.
  • 7邵春丽,胡鹏,黄承义,彭琪.DELAUNAY三角网的算法详述及其应用发展前景[J].测绘科学,2004,29(6):68-71. 被引量:65

二级参考文献14

  • 1[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.
  • 2[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.
  • 3[4]Dawyer R A.A fast divide-and-conquer algorithm for constructing Delaunay triangulations[J].Algorithmica, 1987, (2): 137-151.
  • 4[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.
  • 5[7]Brassel K E and Reif D. Procedure to generate thissen polygons[J]. Geographical Analysis, 1979,11:289-303.
  • 6[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.
  • 7[10]Mirante A and WeinGarten N. The radical sweep algorithm for constructing triangulated irregular networks[J]. IEEE. Computer Graphics and application, 1982:11-21.
  • 8[13]YI Xiao, HONG Yan. Text region extraction in a document image based on the delaunay tessellation[J]. Pattren Recgonition, 2003,36.
  • 9[14]Joon Hong Park, Hyun WookPark. Fast view interpolation of stereo images using image gradient and disparity triangulation[J]. Signal Processing: Image Communition,2003,18:401-406.
  • 10武晓波,王世新,肖春生.Delaunay三角网的生成算法研究[J].测绘学报,1999,28(1):28-35. 被引量:350

共引文献64

同被引文献11

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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