[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Path Finding Method for Various Applications

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3980))

Included in the following conference series:

  • 1224 Accesses

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 to check access.

Access this chapter

Log in via an institution

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. 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)

    Article  MATH  Google Scholar 

  2. Hatna, A., Grieve, R.J., Broomhead, P.: Automatic CNC milling of pockets: geometric and technological issues. Computer Integrated Manufacturing Systems 11, 309–330 (1998)

    Article  Google Scholar 

  3. Kim, D.S.: Polygon offsetting using a Voronoi diagram and two stacks. Computer Aided Design 30, 1069–1076 (1998)

    Article  MATH  Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. Park, S., Chung, Y., Choi, B.: Contour-parallel offset machining without tool-retractions. Computer Aided Design 35, 35–45 (2003)

    Google Scholar 

  6. Guyder, M.: Automating the optimization of 2.5 axis milling. Computer Industry 15, 163–168 (1990)

    Article  Google Scholar 

  7. 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)

    Google Scholar 

  8. Horowitz, E., Sahni, S.: Anderson-Freed S.: Fundamentals of data structures in C. Computer Science PRESS, W. H. Freeman and Company (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tongmyong University, Busan, 608-711, Korea

    Jaesung Song & Manseung Seo

  2. Hokkaido University, Sapporo, Hokkaido, 060-0808, Japan

    Masahiko Onosato

Authors
  1. Jaesung Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manseung Seo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masahiko Onosato
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation