Synthesis of spatially and intrinsically constrained curves using simulated annealing

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]  Sung Yong Shin,et al.  A Linear Time Algorithm for Triangulating a Point-Visible Polygon , 1985, ACM Trans. Graph..

[2]  Rida T. Farouki,et al.  On the numerical condition of polynomials in Bernstein form , 1987, Comput. Aided Geom. Des..

[3]  Les A. Piegl,et al.  On NURBS: A Survey , 2004 .

[4]  Wolfgang Böhm,et al.  A survey of curve and surface methods in CAGD , 1984, Comput. Aided Geom. Des..

[5]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[6]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[7]  Gerald E. Farin,et al.  Automatic fairing algorithm for B-spline curves , 1990, Comput. Aided Des..

[8]  T. Elperin,et al.  Monte Carlo structural optimization in discrete variables with annealing algorithm , 1988 .

[9]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

[10]  Sandro Ridella,et al.  Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithmCorrigenda for this article is available here , 1987, TOMS.

[11]  Carl de Boor,et al.  A Practical Guide to Splines , 1978, Applied Mathematical Sciences.

[12]  P. Lancaster Curve and surface fitting , 1986 .

[13]  D. R. Ferguson Construction of curves and surfaces using numerical optimization techniques , 1986 .

[14]  L. Piegl,et al.  Curve and surface constructions using rational B-splines , 1987 .

[15]  A. Seireg,et al.  Optimal and Conforming Motion of a Point in a Constrained Plane , 1994 .

[16]  Rob A. Rutenbar,et al.  Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

[17]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

[18]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[19]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[20]  Srinivas Devadas,et al.  Topological Optimization of Multiple-Level Array Logic , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.