论文信息 - Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining

Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining

Abstract In 4- and 5-axis NC machines, the time to dismount, recalibrate, and remount the workpiece after each set of accessible faces of the workpiece has been machined can be considerable in comparison to the actual machining time. Unfortunately, the problem of minimizing the number of setups is NP-hard. In this paper, efficient algorithms are given for a greedy heuristic, where the goal is to find an orientation for the workpiece which maximizes the number of faces that can be machined in a single setup—using either a ball-end or a filletend cutter. The algorithms are based on geometric duality, topological sweep, interesting new properties concerning intersection and covering on the unit-sphere, and on techniques for efficiently constructing and searching an arrangement of polygons on the unit-sphere. The results imply that the optimal number of set-ups can be approximated to within a logarithmic factor. Evidence is also provided that it may not be possible to improve substantially on the proposed algorithms.

[1] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[2] Subhash Suri,et al. Finding tailored partitions , 1989, SCG '89.

[3] Leonidas J. Guibas,et al. The power of geometric duality , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4] Kai Tang,et al. Maximum Intersection of Spherical Polygons and Workpiece Orientation for 4- and 5-Axis Machining , 1992 .

[5] Shuo-Yan Chou,et al. Separating and intersecting spherical polygons: computing machinability on three-, four-, and five-axis numerically controlled machines , 1993, TOGS.

[6] Raimund Seidel,et al. Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies , 1993, Discret. Comput. Geom..

[7] Raimund Seidel,et al. Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8] T. C. Woo,et al. Spherical Maps: Their Construction, Properties, and Approximation , 1994 .

[9] Leonidas J. Guibas,et al. Topologically sweeping an arrangement , 1986, STOC '86.

[10] Bernard Chazelle,et al. Better lower bounds on detecting affine and spherical degeneracies , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.