【摘要】 提出一种任意三角网格模型上两点间的近似最短路径算法 该算法首先将三角网格模型表示为带权图结构 ,然后用Dijkstra算法计算带权图中两顶点间的最短路径 ,并将其作为网格模型上该两点间最短路径的初始近似 通过不断地迭代对相关三角形边进行自适应细分 ,并构造每次细分后新的带权图 ,从而对网格模型上的两点间最短路径进行迭代逼近 该算法效率高 ,可以很好地控制精度 ,适用于大型三角网格模型两点间最短路径寻找 文中还讨论了该算法在任意三角网格模型区域划分中的应用更多还原

【Abstract】 The triangle mesh model is represented by a weighted graph structure and Dijkstra’s algorithm is used to calculate the shortest path between two points on the graph By iteratively subdividing the related triangle edges and constructing new weighted graph, the shortest path between points on the graph finally approaches the shortest path on the mesh surface The algorithm is highly efficient, and quite suitable for the shortest path finding of large scale models Application of the algorithm in model segmentation is also demonstrated更多还原