MAXIMUM INTERSECTION OF SPHERICAL POLYGONS AND WORKPIECE ORIENTATION FOR 4-AXIS AND 5-AXIS MACHINING

被引：39

作者：

TANG, K

WOO, T

GAN, J

机构：

[1] The University of Michigan, Dept of Industrial and Operations Engineering, Ann Arbor, MI

[2] Nanyang Technological University, Dept of Mechanical and Production Engineering

来源：

JOURNAL OF MECHANICAL DESIGN | 1992年 / 114卷 / 03期

关键词：

D O I：

10.1115/1.2926576

中图分类号：

TH [机械、仪表工业];

学科分类号：

0802 ;

摘要：

Orienting the workpiece in such a way as to minimize the number of setups in a 4-axis or a 5-axis Numerical Control (NC) machine is formulated as follows: Given a set of spherical polygons (that are representations of curved surfaces visible to a 3-axis NC machine), find a great circle (the 4th axis) or a band (the 4th and the 5th axes) containing a great circle that intersects the polygons maximally. While there are.potentially infinitely many solutions to this problem, a sphere is partitioned into O (N2) regions based on the N polygons. Within each of these regions, it is shown that it requires O(NlogN) time to determine maximum intersections and all the solutions are congruent. Central projection mapping is employed so as to present the algorithms in the plane.

引用

页码：477 / 485

页数：9

共 6 条

[1]

Chen L.-L., Woo T.C., Computational Geometry for Automated Machining, ASME Journal of Mechanical Design

[2]

Gan J.G., Spherical Algorithms for Setup Orientations of Workpieces with Sculptured Surfaces, (1990)

[3]

Hilbert D., Vossen S.C., Geometry and Imagination, (1952)

[4]

Preparata F.P., Shamos M.L., Computational Geometry, (1985)

[5]

Rohnert H., Shortest Paths in the Plane with Convex Polygonal Obstacles, Information Processing Letters, 23, pp. 71-76, (1986)

[6]

Tang K., On the Intersection of a Set of Direction Cones, Computer Vision, Graphics and Image Processing, 45, pp. 357-361, (1989)

← 1 →