| 顾及几何形状相似性的简单多边形最近距离计算方法 |
| |
| 引用本文： | 杨春成,张清浦,田向春,何列松,苏永宪.顾及几何形状相似性的简单多边形最近距离计算方法[J].测绘学报,2004,33(4):311-318. |
| |
| 作者姓名： | 杨春成 张清浦 田向春 何列松 苏永宪 |
| |
| 作者单位： | 西安测绘研究所,陕西,西安,710054;中国测绘科学研究院,北京,100039 |
| |
| 摘 要： | 提出简单多边形距离计算方法,在计算简单多边形最近距离的同时,可以求得多边形之间彼此面对的线段链.针对多边形之间不同位置关系,给出不同的最近距离和多边形之间彼此面对线段链的计算算法.
|
| 关 键 词： | 空间聚类 简单多边形 凸多边形 凸壳 |
| 文章编号： | 1001-1595(2004)04-0311-08 |
A Closest Distance Computation Method for Simple Polygons Considering Geometry Shape Similarity |
| |
| YANG Chun-cheng,ZHANG Qin-pu,TIAN Xiang-chun,HE Lie-song,SU Yong-xian.A Closest Distance Computation Method for Simple Polygons Considering Geometry Shape Similarity[J].Acta Geodaetica et Cartographica Sinica,2004,33(4):311-318. |
| |
| Authors: | YANG Chun-cheng ZHANG Qin-pu TIAN Xiang-chun HE Lie-song SU Yong-xian |
| |
| Institution: | YANG Chun-cheng~1,ZHANG Qin-pu~2,TIAN Xiang-chun~1,HE Lie-song~1,SU Yong-xian~1 |
| |
| Abstract: | A closest distance computation method for simple polygons has been presented in this paper, which can be used to get the line segments (one chain from each polygon) of polygons at the same time. The line segments "face" each other in the sense that a vertex in either chain can "see" at least one vertex in the other chain. Closest distance computation algorithms and chains calculating algorithms have been designed according to different location relationships. |
| |
| Keywords: | spatial clustering simple polygon convex polygon convex hull |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
