Maximal intersection of spherical polygons by an arc with applications to 4-axis machining

Abstract Many geometric optimization problems in CAD/CAM can be reduced to a maximal intersection problem on the sphere: given a set of N simple spherical polygons on the unit sphere and a real number constant L≤2π, find an arc of length L on the unit sphere that intersects as many spherical polygons as possible. Past results can only solve this maximization problem for two very restricted special cases: the arc must be either a great circle or a semi-great circle. In this paper, a simple and deterministic algorithm based on domain partitioning is presented for solving this maximal arc intersection problem in the general case when the number L is arbitrary. The algorithm is made possible by reducing the domain of the arcs to a continuous sub-space in R 2 and then establishing a quotient space partitioning in this sub-space based on a congruence relation. The number of the constituting congruent sub-regions in this quotient space partitioning is shown to have an upper-bound O(E3), where E is the total number of edges on the polygons. The proposed algorithm has a worst-case upper bound O(ME) on its running time, where M is an output-sensitive number and is bounded by O(E3). Examples including two realistic tests for 4-axis NC machining are presented.

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

[2]  Masaki Hilaga,et al.  Topological Modeling for Visualization , 1997 .

[3]  W. Press,et al.  Numerical Recipes in C++: The Art of Scientific Computing (2nd edn)1 Numerical Recipes Example Book (C++) (2nd edn)2 Numerical Recipes Multi-Language Code CD ROM with LINUX or UNIX Single-Screen License Revised Version3 , 2003 .

[4]  Vwani P. Roychowdhury,et al.  Two Geometric Optimization Problems , 1994 .

[5]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

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

[7]  Jacob Gan.  Spherical algorithms for setup orientation of workpieces with sculptured surfaces , 1990 .

[8]  Prosenjit Gupta,et al.  Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining , 1995, WADS.

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

[10]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[11]  D. Du,et al.  Advances in optimization and approximation , 1994 .

[12]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

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

[14]  T. C. Woo,et al.  Computational Geometry on the Sphere With Application to Automated Machining , 1992 .

[15]  H. Piaggio.  Differential Geometry of Curves and Surfaces , 1952, Nature.

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