Solution of Shortest Distance Between Two Points in Presence of Obstacles
Shiqin Yang · Jisuanji gongcheng · 2010
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.