抄録
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 1 1 |
| 外部発表 | Yes |
Fingerprint
ASJC Scopus subject areas
- Mechanics of Materials
- Mechanical Engineering
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
これを引用
Computation of shortest paths on free-form parametric surfaces. / Maekawa, Takashi.
：: Journal of Mechanical Design, Transactions Of the ASME, 巻 118, 番号 4, 01.01.1996, p. 499-508.研究成果: Article
}
TY - JOUR
T1 - Computation of shortest paths on free-form parametric surfaces
AU - Maekawa, Takashi
PY - 1996/1/1
Y1 - 1996/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0030402657&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030402657&partnerID=8YFLogxK
U2 - 10.1115/1.2826919
DO - 10.1115/1.2826919
M3 - Article
AN - SCOPUS:0030402657
VL - 118
SP - 499
EP - 508
JO - Journal of Mechanical Design - Transactions of the ASME
JF - Journal of Mechanical Design - Transactions of the ASME
SN - 1050-0472
IS - 4
ER -