网格曲面近似“最直路径”的快速计算

Fast Computing for the Approximate Straightest Path on Triangular Mesh Surfaces

为实现网格模型两点间最短路径的近似逼近,提出一种网格曲面上近似"最直路径"的计算方法.利用起点与终点邻域特征获得初始切割面,对网格曲面上的三角片逐步切割求交,扩展"最直路径";在求交过程中逐步调整切割平面的方向,直至终点.实验结果表明,文中方法快速、有效.

To obtain the approximation of the shortest path between two points on mesh models, a new method for approximately computing the straightest path on mesh models is proposed in this paper. It utilizes the neighboring feature of the starting point and the end point to determine the initial cutting plane. Then, it calculates the intersection point on the facets of the triangular mesh to extend the straightest path. During this process, it adjusts the direction of the cutting plane when a new intersection point is obtained. The adjustment terminates until the path reaches the end point. The experimental results show that the proposed algorithm is fast and effective.