中文摘要：

提出角度约束路径法,快速获取三角网格曲面上任意两顶点间一条由网格边所组成的路径.该算法是一个从起始点开始不断向前传播的过程,计算量仅与两顶点间的曲面区域有关,故算法的时间复杂度（O（n））优于Dijkstra算法（O（nlog n））.试验结果表明：角度约束路径法的执行快速、有效;基于该方法可实现三角网格曲面兴趣区域边界的快速交互选取.

英文摘要：

In this paper, an angular constraint path method is presented, which can get a path composed of mesh edges rapidly between any two vertices on triangular mesh surface. The algorithm is a continuous transmission process from its starting point. The amount of calculation is only related to the surface area between two vertices, so the time complexity of the algorithm （O（n）） is superior to Dijkstra algorithm （O（n log n））. Experimental results show that the performance of angular constraint path method is quickly, effectively. And fast interactive selection of interest region boundary on tri- angular mesh surface is realized based on this method.