Abstract: This paper simplifies the problem, emphasizing on simplifying shape of object, and seeing encasing of box planar convex polygon as simplified object, and puts forward one design method of moving path based on local greedy method. Experiments prove the method has preferable applied importance.

摘要： 首先对问题进行了简化，重点把地形中地物的形状简化成包围其边界的凸多边形包围盒，并且提出了简化问题的基于局部贪心的规划方法，实验结果证明，该方法命中最优路径的可能性较高，具有一定的应用价值。

关键词: 路径, 非点状图, 凸多边形, 包围盒, 线与多边形相交

CLC Number: 

• TP391.41