Abstract
Increasing the robustness and flexibility of the tool path finding method may broaden the application fields of pocket machining. We aim to develop a path finding method for various applications. Through an integration of the entire tool path finding process, the method becomes not merely optimal to generate an efficient path but also robust enough to be applied to any system with any configuration. The flexibility of the devised method enables us to broaden the application fields of pocketing to fields such as prototype printed circuit board manufacturing. The devised method is applied to generate a clearing path for prototype printed circuit boards. The results verify that the method is concise and simple, but robust and flexible enough to achieve the optimal path in any configuration.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Held, M., Lukacs, G., Andor, L.: Pocket machining base on contour-parallel tool paths generation by means of proximity maps. Computer Aided Design 26, 189–203 (1994)
Hatna, A., Grieve, R.J., Broomhead, P.: Automatic CNC milling of pockets: geometric and technological issues. Computer Integrated Manufacturing Systems 11, 309–330 (1998)
Kim, D.S.: Polygon offsetting using a Voronoi diagram and two stacks. Computer Aided Design 30, 1069–1076 (1998)
Shan, Y., Wang, S., Tong, S.: Uneven offset of NC tool path generation for free-form pocket machining. Computers in Industry 43, 97–103 (2000)
Park, S., Chung, Y., Choi, B.: Contour-parallel offset machining without tool-retractions. Computer Aided Design 35, 35–45 (2003)
Guyder, M.: Automating the optimization of 2.5 axis milling. Computer Industry 15, 163–168 (1990)
Seo, M., Kim, H., Onosato, M.: Systematic approach to contour-parallel tool path generation of 2.5-D pocket with islands. Computer-Aided Design and Applications 2, 213–222 (2005)
Horowitz, E., Sahni, S.: Anderson-Freed S.: Fundamentals of data structures in C. Computer Science PRESS, W. H. Freeman and Company (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, J., Seo, M., Onosato, M. (2006). Path Finding Method for Various Applications. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_50
Download citation
DOI: https://doi.org/10.1007/11751540_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34070-6
Online ISBN: 978-3-540-34071-3
eBook Packages: Computer ScienceComputer Science (R0)