Show simple item record

contributor authorK. Tang
contributor authorJ. Gan
contributor authorT. Woo
date accessioned2017-05-08T23:39:06Z
date available2017-05-08T23:39:06Z
date copyrightSeptember, 1992
date issued1992
identifier issn1050-0472
identifier otherJMDEDB-27599#477_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/110616
description abstractOrienting 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.
publisherThe American Society of Mechanical Engineers (ASME)
titleMaximum Intersection of Spherical Polygons and Workpiece Orientation for 4- and 5-Axis Machining
typeJournal Paper
journal volume114
journal issue3
journal titleJournal of Mechanical Design
identifier doi10.1115/1.2926576
journal fristpage477
journal lastpage485
identifier eissn1528-9001
keywordsMachining AND Intersections
treeJournal of Mechanical Design:;1992:;volume( 114 ):;issue: 003
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record