Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining | SpringerLink
Skip to main content

Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining

  • Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 955))

Included in the following conference series:

  • 189 Accesses

Abstract

In 4- and 5-axis NC machines, the time to dismount, recalibrate, and remount the workpiece after each set of accessible faces has been machined can be considerable in comparison to the actual machining time. The problem of minimizing the number of setups is NP-hard. Efficient algorithms are given for a greedy heuristic which finds an orientation maximizing the number of faces that can be machined in a single setup. These results are based on geometric duality, topological sweep, interesting new properties concerning intersection and covering on the unit-sphere, and on techniques for efficiently constructing and searching an arrangement of polygons on the unit-sphere.

The research of these authors was supported in part by NSF grant CCR-9200270.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. L. Chen, S. Chou and T. Woo. Separating and intersecting spherical polygons: computing machinability on three-, four-, and five-axis numerically controlled machines. ACM Trans. on Graphics, 12(4):305–326, 1993.

    Article  Google Scholar 

  2. H. Edelsbrunner and L.J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., Vol. 38, pages 165–194, 1989.

    Article  Google Scholar 

  3. H. Edelsbrunner, J. O'Rourke and R. Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM J. on Computing, Vol. 15, pages 341–363, 1986.

    Article  Google Scholar 

  4. A. Gajentaan and M.H. Overmars On a class of O(n 2) problems in computational geometry. RUUCS-93-15, Dept. of Computer Sc., Utrecht University.

    Google Scholar 

  5. J.G. Gan, T.C. Woo and K. Tang. Spherical maps: their construction, properties, and approximation. J. of Mech. Design, 116:357–363, 1994.

    Google Scholar 

  6. P. Gupta, R. Janardan, J. Majhi and T. Woo. Efficient geometric algorithms for workpiece orientation in 4-axis and 5-axis NC-machining. Technical Report, TR-95-015, Dept. of Computer Science, University of Minnesota.

    Google Scholar 

  7. J. Hershberger and S. Suri. Finding tailored partitions. Journal of Algorithms, Vol. 12, pages 431–463, 1991.

    Article  Google Scholar 

  8. K. Tang, T. Woo and J. Gan. Maximum intersection of spherical polygons and workpiece orientation for 4-and 5-Axis Machining. Journal of Mechanical Design, Vol. 114, pp. 477–485, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Selim G. Akl Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gupta, P., Janardan, R., Majhi, J., Woo, T. (1995). Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-60220-8_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60220-0

  • Online ISBN: 978-3-540-44747-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics