摘要
定义了长廊为平面上由一序列凸四边形构成的有界连通区域 ,提出长廊最短路径问题 ,并给出求长廊最短路径的一个算法 ,最后证明该算法的正确性和在最坏情况下的最优性 .
The paper defines gallery as a bounded connected region which is formed from a sequence of convex quadrangles on a plane. An algorithm for finding the shortest path is presented, and its correctness as well as optimality in the worst case is analyzed.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2002年第12期1138-1141,共4页
Journal of Computer-Aided Design & Computer Graphics
基金
国家重点基础研究发展规划项目 (G19980 3 0 60 0 )资助
