Computation of shortest paths on free-form surfaces is an important problem in ship design, robot motion planning, computation of medial axis transforms of trimmed surface patches, terrain navigation and NC machining. The objective of this paper is to provide an efficient and reliable method for computing the shortest path between two points on a free-form parametric surface and the shortest path between a point and a curve on a free-form parametric surface. These problems can be reduced to solving a two point boundary value problem. Our approach for solving the two point boundary value problem is based on a relaxation method relying on finite difference discretization. Examples illustrate our method.
|ジャーナル||Journal of Mechanical Design, Transactions of the ASME|
|出版ステータス||Published - 1996 12月|
ASJC Scopus subject areas
- コンピュータ サイエンスの応用
- コンピュータ グラフィックスおよびコンピュータ支援設計