k Globally Different Optimal Sequenced Route Query Based on Obstacles
Hao Zhong-xiao · Jisuanji gongcheng · 2011
The problem of k Obstructed Globally Different Optimal Sequenced Route(kOGDOSR) query is proposed.The approximate algorithm for resolving this query problem is put forward based on visibility graph.The introduction of effect set and obstructed angle point reduces the number of obstacles used in the configuration of visibility graph.It decreases the number of inner obstructed route calculations through analyzing the relationship between the line segment from query point to data point and the vertices and arcs of the visibility graph.The algorithm is optimized completely through the two aspects described above.Experimental results indicate that the algorithm presented has a better performance.