On the performance of maximal intersection of spherical polygons by arcs

An important real-world optimization problem in manufacturing industry is to determine optimal workpiece setups for 4-axis NC machining. In this paper we reveal some interesting relations between this optimal workpiece setup problem and the two classic NP-hard problems in complexity theory (i.e, the vertex cover problem and the set cover problem). These relations immediately show the following results. First the optimal workpiece setup problem is NP-hard. Secondly, the greedy algorithm proposed in [Comput. Aided Des. 35 (2003) pp. 1269–1285] for the optimal workpiece setup problem has the performance ratio bounded by O(ln n−ln ln n+0.78), where n is the number of spherical polygons in the ground set.

[1]  Kai Tang,et al.  A geometric method for determining intersection relations between a movable convex object and a set of planar polygons , 2004, IEEE Transactions on Robotics.

[2]  Kai Tang,et al.  Maximal intersection of spherical polygons by an arc with applications to 4-axis machining , 2003, Comput. Aided Des..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[5]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[6]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[7]  Allan Borodin,et al.  (Incremental) Priority Algorithms , 2002, SODA '02.

[8]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

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

[10]  Prosenjit Gupta,et al.  Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining , 1996, Comput. Aided Des..

[11]  Allan Borodin,et al.  The Power of Priority Algorithms for Facility Location and Set Cover , 2004, Algorithmica.

[12]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[13]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

[14]  Shuo-Yan Chou,et al.  Optimal workpiece setups for 4-axis numerical control machining based on machinability , 1998 .

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

[16]  Kai Tang,et al.  An optimization algorithm for free-form surface partitioning based on weighted gaussian image , 2005, Graph. Model..