| 带障碍物情况下两点间最短距离的求解方法 |
| |
| 引用本文： | 陈智鹏,杨诗琴.带障碍物情况下两点间最短距离的求解方法[J].计算机工程,2010,36(16):171-173. |
| |
| 作者姓名： | 陈智鹏 杨诗琴 |
| |
| 作者单位： | 1. 上海电机学院电子信息学院,上海,200240
2. 上海电机学院信息化办公室,上海,200240 |
| |
| 基金项目： | 上海市高校选拔培养优秀青年教师科研专项基金资助项目 |
| |
| 摘 要： | 带障碍物聚类问题的关键是求解存在障碍物情况下两点间的最短距离。针对该问题提出边缘可见点概念，给出一种解决方法，从一点依次寻找障碍物上的边缘可见点，顺次连接这些点，可以形成上边缘最短路径和下边缘最短路径，最终的最短路径是这两者中的较短者。实验结果验证了该方法的有效性。
|
| 关 键 词： | 聚类 障碍物 凸多边形 边缘可见点 |
Solution of Shortest Distance Between Two Points in Presence of Obstacles |
| |
| CHEN Zhi-peng,YANG Shi-qin.Solution of Shortest Distance Between Two Points in Presence of Obstacles[J].Computer Engineering,2010,36(16):171-173. |
| |
| Authors: | CHEN Zhi-peng YANG Shi-qin |
| |
| Affiliation: | (1. College of Electronics & Information, Shanghai Dianji University, Shanghai 200240; 2. Information Office, Shanghai Dianji University, Shanghai 200240) |
| |
| Abstract: | A key of the Clustering with Obstructed Distance(COD) problem is solving the shortest distance between two points in the presence of obstacles. Aiming at this problem, this paper presents the concept of edge visible points, and proposes a solution to the problem. It departs from the point, and finds edge visible points on the set of obstructions, and sequential connects these points. It forms a shortest path along upper edge and a shortest path along lower edge, the final shortest path is the shorter of the two. Experimental results verify the effectiveness of the method. |
| |
| Keywords: | clustering obstacles convex polygon edge visible point |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
