A general technique is presented for automatic generation of B-spline curves in a spatially constrained environment, subject to specified intrinsic shape properties. Spatial constraints are characterized by a distance metric relating points on the curve to polyhedral models of obstacles which the curve should avoid. The shape of the curve is governed by constraints based on intrinsic curve properties such as parametric variation and curvature. To simultaneously address the independent goals of global obstacle avoidance and local control of intrinsic shape properties, curve synthesis is formulated as a combinatorial optimization problem and solved via simulated annealing. Several example applications are presented which demonstrate the robustness of the technique. The synthesis of both uniform and nonuniform B-spline curves is also demonstrated. An extension of the technique to general sculptured surface model synthesis is briefly described, and a preliminary example of simple surface synthesis presented.

1.
Ahrikencheikh
C.
,
Seireg
A. A.
, and
Ravani
B.
,
1989
, “
Optimal and Conforming Motion of a Point in a Constrained Plane
,”
ASME Advances in Design Automation
, DE-Vol.
19-1
, pp.
369
375
.
2.
Bo¨hm
W.
,
Farin
G.
, and
Kahmann
J.
,
1984
, “
A Survey of Curve and Surface Methods in CAGD
,”
Computer Aided Geometric Design
, Vol.
1
, pp.
1
60
.
3.
Bo¨hm
W.
,
1984
, “
Efficient Evaluation of Splines
,”
Computing
, Vol.
33
, pp.
171
177
.
4.
Brooks
R. A.
,
1983
, “
Solving the Find-Path Problem by Good Representation of Free Space
,”
IEEE Transactions on Systems, Man, and Cybernetics
, Vol.
SMC-13
, No.
2
, pp.
190
197
.
5.
Corana
A.
,
Marchesi
M.
,
Martini
C.
, and
Ridella
S.
,
1987
, “
Minimizing Multimodal Functions of Continuous Variables with the Simulated Annealing Algorithm
,”
ACM Transactions on Mathematical Software
, Vol.
13
, No.
3
, pp.
262
280
.
6.
deBoor, C., 1978, A Practical Guide to Splines, Applied Mathematical Sciences, Vol. 27, Springer-Verlag, New York.
7.
Devadas
S.
, and
Newton
A. R.
,
1987
, “
Topological Optimization of Multiple-Level Array Logic
,”
IEEE Transactions on Computer-Aided Design
, Vol.
CAD-6
, No.
6
, pp.
915
941
.
8.
Elperin
T.
,
1988
, “
Monte Carlo Structural Optimization in Discrete Variables with Annealing Algorithm
,”
International Journal for Numerical Methods in Engineering
, Vol.
26
, pp.
815
821
.
9.
Farin, G., 1988, Curves and Surfaces for Computer Aided Geometric Design, Academic Press, San Diego.
10.
Farouki
R. T.
, and
Rajan
V.
,
1987
, “
On the Numerical Condition of Polynomials in Bernstein Form
,”
Computer Aided Geometric Design
, Vol.
4
, pp.
191
216
.
11.
Ferguson
D. R.
,
1986
, “
Construction of Curves and Surfaces Using Numerical Optimization Techniques
,”
Computer Aided Design
, Vol.
18
, No.
1
, pp.
15
19
.
12.
Gilbert
E. G.
, and
Johnson
D. W.
,
1985
, “
Distance Functions and Their Application to Robot Path Planning in the Presence of Obstacles
,”
IEEE Journal of Robotics and Automation
, Vol.
RA-1
, No.
1
, pp.
21
30
.
13.
Jain
P.
, and
Agogino
A. M.
,
1988
, “
Optimal Design of Mechanisms Using Simulated Annealing: Theory and Applications
,”
ASME Advances in Design Automation
, DE-Vol.
14
, pp.
233
240
.
14.
Kirkpatrick
S.
,
Gelatt
C. D.
, and
Vecchi
M. P.
,
1983
, “
Optimization by Simulated Annealing
,”
Science
, Vol.
220
, No.
4598
, pp.
671
680
.
15.
Ku
T. S.
, and
Ravani
B.
,
1988
a, “
Model Based Rigid Body Guidance in Presence of Non-Convex Geometric Constraints
,”
ASME Advances in Design Automation
, DE-Vol.
14
, pp.
67
79
.
16.
Ku
T. S.
, and
Ravani
B.
,
1988
b, “
A Separating Channel Decomposition Algorithm for Non-Convex Polygons with Application in Interference Detection
,”
ASME Advances in Design Automation
, DE-Vol.
14
, pp.
55
65
.
17.
Lancaster, P., and Salkauskas, K., 1986, Curve and Surface Fitting, Academic Press, San Diego.
18.
Lee
E. T. Y.
,
1983
, “
A Simplified B-spline Computation Routine
,”
Computing
, Vol.
29
, pp.
365
371
.
19.
Liu
C. Y.
, and
Mayne
R. W.
,
1990
, “
Distance Calculations in Motion Planning Problems with Interference Situations
,”
ASME Advances in Design Automation
, DE-Vol.
23-1
, pp.
145
152
.
20.
Lozano-Perez
T.
, and
Wesley
M. A.
,
1979
, “
An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles
,”
Communications of the ACM
, Vol.
22
, No.
10
, pp.
560
570
.
21.
Metropolis
N.
,
Rosenbluth
A.
,
Rosenbluth
M.
, and
Teller
A.
,
1953
, “
Equations of State Calculations by Fast Computing Machines
,”
Journal of Chemical Physics
, Vol.
21
, pp.
1087
1091
.
22.
Mortenson, M. E., 1985, Geometric Modeling, Wiley, New York.
23.
Park
S. K.
, and
Miller
K. W.
,
1988
, “
Random Number Generators: Good Ones Are Hard to Find
,”
Communications of the ACM
, Vol.
31
, No.
10
, pp.
1192
1201
.
24.
Piegl
L.
, and
Tiller
W.
,
1987
, “
Curve and Surface Constructions Using Rational B-splines
,”
Computer Aided Design
, Vol.
19
, No.
9
, pp.
485
498
.
25.
Piegl
L.
,
1991
, “
On NURBS: A Survey
,”
IEEE Computer Graphics and Applications
, Vol.
11
, No.
1
, pp.
55
71
.
26.
Oliver, J. H., 1992, “Recent Advances in Constrained B-spline Synthesis,” Proc. 1992 NSF Design and Manufacturing Systems Conference, Atlanta, GA, pp. 387–393.
27.
Rutenbar, R. A., 1989, “Simulated Annealing Algorithms: An Overview,” IEEE Circuits and Devices, January, pp. 19–26.
28.
Sandgren
E.
, and
Vekataraman
S.
,
1989
, “
Robot Path Planning via Simulated Annealing: A Near Real-Time Approach
,”
ASME Advances in Design Automation
, DE-Vol.
19–1
, pp.
345
351
.
29.
Sapidis
N.
, and
Farin
G.
,
1990
, “
Automatic Fairing Algorithm for B-Spline Curves
,”
Computer-Aided Design
, Vol.
22
, No.
2
, pp.
121
129
.
30.
VanLaarhoven, P. J. M., and Aarts, E. H. L., 1988, Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, Dordrecht.
31.
Woo
T. C.
, and
Shin
S. Y.
,
1985
, “
A Linear Time Algorithm for Triangulating a Point Visible Polygon
,”
ACM Transactions on Graphics
, Vol.
3
, No.
2
, pp.
60
70
.
32.
Yang, D. C. H., 1990, “Collision-Free Path Planning by Using Non-Periodic B-spline Curves,” presented at 16th ASME Design Automation Conference, Chicago, IL, September, 1990.
This content is only available via PDF.
You do not currently have access to this content.