Computation of shortest paths on free-form parametric surfaces

研究成果: Article査読

49 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)499-508
ページ数10
ジャーナルJournal of Mechanical Design, Transactions of the ASME
118
4
DOI
出版ステータスPublished - 1996 12月
外部発表はい

ASJC Scopus subject areas

  • 材料力学
  • 機械工学
  • コンピュータ サイエンスの応用
  • コンピュータ グラフィックスおよびコンピュータ支援設計

フィンガープリント

「Computation of shortest paths on free-form parametric surfaces」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル