0
TECHNICAL PAPERS

An Algorithm for a Near Optimal NC Path Generation in Staircase (Lase) Traversal of Convex Polygonal Surfaces

[+] Author and Article Information
S. V. Kamarthi

Department of Mechanical, Industrial, & Manufacturing Engineering, Northeastern University, 334 Snell Engineering Center, Boston, MA 02115

S. T. S. Bukkapatnam

Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089

S. Hsieh

Lead Lean Manufacturing Deployment, Purchasing Division, Ford Lio Ho Motor Company, Ltd. (Taiwan)

J. Manuf. Sci. Eng 122(1), 182-190 (Mar 01, 1999) (9 pages) doi:10.1115/1.538895 History: Received May 01, 1996; Revised March 01, 1999
Copyright © 2000 by ASME
Topics: Algorithms , Milling
Your Session has timed out. Please sign back in to continue.

References

Figures

Grahic Jump Location
Typical paths from OPTPATH, IH and PGW algorithms
Grahic Jump Location
Variation of path length with sweep angle θ for four different diameters
Grahic Jump Location
Terminology of staircase pattern
Grahic Jump Location
Staircase pattern when the sense of traverse is (a) clockwise and (b) counter-clockwise

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In