The shortest path in a simply-connected domain having a curved boundary

被引：7

作者：

Ram, S. Bharath ^{[1
]}

Ramanathan, M. ^{[1
]}

机构：

[1] Indian Inst Technol, Dept Engn Design, Madras 600036, Tamil Nadu, India

来源：

COMPUTER-AIDED DESIGN | 2011年 / 43卷 / 08期

关键词：

Shortest path; Simply-connected curves; Freeform curve;

D O I：

10.1016/j.cad.2011.03.007

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Given two distinct points S and E on a closed parametric curve forming the boundary of a simply-connected domain (without holes), this paper provides an algorithm to find the shortest interior path (SIP) between the two points in the domain. The SIP consists of portions of curves along with straight line segments that are tangential to the curve. The algorithm initially computes point-curve tangents and bitangents using their respective constraints. They are then analyzed further to identify potential tangents. A region check is performed to determine the tangent that will form part of the SIP. Portions of the curve that belong to the SIP are also identified during the process. The SIP is identified without explicitly computing the length of the curves/tangents. The curve is represented using non-uniform rational B-splines (NURBS). Results of the implementation are provided. (C) 2011 Elsevier Ltd. All rights reserved.

引用

页码：923 / 933

页数：11

共 50 条

[1] Shortest path in a multiply-connected domain having curved boundaries
Ram, S. Bharath
Ramanathan, M.
[J]. COMPUTER-AIDED DESIGN, 2013, 45 (03) : 723 - 732
[2] EXACT MORSE FUNCTIONS ON SIMPLY-CONNECTED MANIFOLDS WITH A BOUNDARY THAT IS NOT SIMPLY-CONNECTED
SHARKO, VV
[J]. RUSSIAN MATHEMATICAL SURVEYS, 1981, 36 (05) : 177 - 178
[3] On computing the shortest path in a multiply-connected domain having curved boundaries
Wei, Xiangzhi
Joneja, Ajay
[J]. COMPUTER-AIDED DESIGN, 2014, 48 : 39 - 41
[4] DISSECTIONS OF A SIMPLY-CONNECTED PLANE DOMAIN
WETZEL, JE
[J]. AMERICAN MATHEMATICAL MONTHLY, 1978, 85 (08): : 660 - 661
[5] On complex vector fields having simply-connected orbits
Scárdua B.
[J]. Qualitative Theory of Dynamical Systems, 2004, 5 (2) : 223 - 245
[6] SIMPLY-CONNECTED 4-MANIFOLDS WITH A GIVEN BOUNDARY
STONG, R
[J]. TOPOLOGY AND ITS APPLICATIONS, 1993, 52 (02) : 161 - 167
[7] Comment on "Clarification on the short communication "On computing the shortest path in a multiply-connected domain having curved boundaries" "
Ram, S. Bharath
Ramanathan, M.
[J]. COMPUTER-AIDED DESIGN, 2014, 52 : 64 - 65
[8] Response to "Clarification on the short communication "On computing the shortest path in a multiply-connected domain having curved boundaries" "
Wei, Xiangzhi
Joneja, Ajay
[J]. COMPUTER-AIDED DESIGN, 2014, 52 : 66 - 66
[9] SIMPLY-CONNECTED 4-MANIFOLDS WITH A GIVEN BOUNDARY
BOYER, S
[J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1986, 298 (01) : 331 - 357
[10] REALIZATION OF SIMPLY-CONNECTED 4-MANIFOLDS WITH A GIVEN BOUNDARY
BOYER, S
[J]. COMMENTARII MATHEMATICI HELVETICI, 1993, 68 (01) : 20 - 47

← 1 2 3 4 5 →