Workpiece orientation is formulated as an optimal design problem based on a discrete approximation of design surface geometry, the kinematic capabilities of the process machine tool, and processing cost. The primary process application addressed is three-and four-axis numerically controlled (NC) milling, although the techniques presented may be applied to machines with more general articulation. Recent developments in applied spherical geometry are employed to formulate a constrained problem, and furthermore, a nonlinear optimization problem. For three-axis milling applications, a weight is assigned to each surface normal of the discrete model corresponding to the actual area it represents. Workpiece/machine orientation is optimized such that the angle between the weighted normals and the milling tool axis is minimized. This formulation is augmented, for four-axis milling, to incorporate limitations of the rotational degree of freedom, into the optimization formulation. The influence of tool geometry is also discussed and incorporated within constrained orientation algorithm.

1.
Albert
M.
,
1990
, “
Integrating Inspection and Machining
,”
Modern Machine Shop
, Vol.
62
, February, pp.
80
90
.
2.
Albert
M.
, and
Hern
R. D.
,
1989
, “
Four Good Reasons for Four-axis Turning
,”
Modern Machine Shop
, Vol.
62
, September, pp.
62
68
.
3.
Berger, M., 1987, Geometry II, Springer-Verlag, New York.
4.
Chen
L. L.
, and
Woo
T. C.
,
1992
, “
Computational Geometry on the Sphere with Application to Automated Machining
,”
ASME JOURNAL OF MECHANICAL DESIGN
, Vol.
114
, No.
2
, pp.
288
295
.
5.
Drysdale, R. L., and Jerard, R. B., 1987, “Discrete Simulation of NC Machining,” Proc. Third Annual ACM Symposium on Computational Geometry, pp. 126–135.
6.
Edelsbrunner
H.
,
1985
, “
Computing the Extreme Distances between Two Convex Polygons
,”
Journal of Algorithms
, Vol.
6
, pp.
213
224
.
7.
Haghpassand, K., 1994, “Computational Geometry for Optimal Work-piece Orientation,” Ph.D. Dissertation, Department of Mechanical and Aerospace Engineering, State University of New York at Buffalo.
8.
Houle
M. E.
, and
Toussaint
G. T.
,
1988
, “
Computing the Width of a Set
,”
IEEE Trans. Pattern Analysis and Machine Intelligence
, Vol.
10
, No.
5
, pp.
761
765
.
9.
Kells, L. M., Kern, W. F., and Bland, J. R., 1940, “Plane and Spherical Trigonometry with Tables,” War Department Education, Manual_EM 318.
10.
Megiddo
N.
,
1983
, “
Linear Time Algorithm for Linear Programming in R3 and Related Problems
,”
SIAM Journal of Computing
, Vol.
12
, No.
4
, pp.
759
776
.
11.
Preparata, F. P., and Shamos, M. I., 1985, Computational Geometry, An Introduction, Springer-Verlag, New York.
12.
Schwartz
J. T.
,
1981
, “
Finding the Minimum Distance between Two Convex Polygons
,”
Information Processing Letters
,
13
, pp.
168
170
.
13.
Tang
K.
,
Woo
T.
, and
Gan
J.
,
1992
, “
Maximum Intersection of Spherical Polygons and Workpiece Orientation for 4- and 5-axis Machining
,”
ASME JOURNAL OF MECHANICAL DESIGN
, Vol.
114
, No.
3
, pp.
477
485
.
This content is only available via PDF.
You do not currently have access to this content.