期刊文献+

根据顶点和边搜索多边形区域的一种算法

SEARCHING OF POLYGONAL REGIONS BASED ON CONNECTION OF VERTICES AND SIDES IN A MAP
下载PDF
导出
摘要 图形学在地球科学中的应用和地球科学信息的空间拓朴关系描述都需要图形中顶点、边同多边形区域的关联信息。本文提出如何根据顶点和边来建立它们同多边形区域关联的算法。这种算法的基本思想是:首先建立所有顶点的三角网络,在三角网络中,实边对应于原来的边,虚边对应于余下的边,于是,任何多边形区域都对应于三角网络中由一个或一个以上三角形以虚边为邻边拼起来的区域。其次是在三角网络中搜索这些区域。搜索一个区域的过程就是遍历一棵树的过程。树的结点是组成该区域的一个个三角形。 Connection of polygonal regions to their vertices snd sides are required for both applications of graphics to earth sciences and description of spatial topological relations for data concerning earth sciences. This paper presents an algorithm of how to set up connextion of vertices and sides to polygonal regions in a map according to connection of those vertices and sides. The basic idea of the algorithm is that: (l)a triangulation of all vertices is constructed in which sides in real line correspoud to original sides in the map and sides in dotted line are others. Therefore, any polygonal region in the map corsists of one or more triangles in the triangulation which are separated by sides in dotted line, and (2) polygonal regions are searched in turn through the triangulation. A process for searching a polygonal region is that of searching a tree in which the nodes are the triangles joined into the polygonal region being searched.
出处 《物探化探计算技术》 CAS CSCD 1992年第4期286-292,共7页 Computing Techniques For Geophysical and Geochemical Exploration
  • 相关文献

参考文献1

  • 1D. T. Lee,B. J. Schachter. Two algorithms for constructing a Delaunay triangulation[J] 1980,International Journal of Computer & Information Sciences(3):219~242 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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