Skip to main content
SpringerLink
Log in

A robust fast bridging algorithm for laser cutting

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Bridging the different parts together is considered a simple but effective strategy to reduce the number of piercing operations during laser cutting. However, fast bridging is never an easy task. In this paper, we present a near-linear bridging algorithm for the input parts with the shortest total bridge length. At first, the input part contours are discretized into a point cloud, then the point cloud is triangulated with the Delaunay standard. The shortest line segments between any two adjacent parts are found in the triangles connecting the two parts. These segments are finally extended into bridges. To solve the problem of the damages to the contour characteristics caused by the bridges, some restrictions are set on the screening of the discrete point cloud and the Delaunay triangles. This algorithm not only ensures the minimum total distance of all bridges, but also avoids the problem of generating bridge loops. Computational experiments show that the proposed bridging algorithm is much faster than that in existing commercial software. The feasibility and superiority of the algorithm are verified by actual lasering cutting experiments.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25

Similar content being viewed by others

Availability of data and materials

Not applicable

Code availability

Not applicable

References

  1. Makarovskikh T, Panyukov A (2021) Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes [J]. Autom and Remote Control 82(3)

  2. Makarovskikh T, Panyukov A (2018) Development of routing methods for cutting out details [C]// OPTA-SCL 2018

  3. Huang X, Xi F, Li J, Zhong Z (2009) Optimal layout and path planning for flame cutting of sheet metals [J]. Int J Comput Integr Manuf 22(1):30–41

    Article  Google Scholar 

  4. Rao Y, Huang G, Li P, Shao X, Yu D (2006) An integrated manufacturing information system for mass sheet metal cutting [J]. Int J Adv Manuf Technol 33(5):436–448

    Google Scholar 

  5. Raggenbass A, Reissner J (1991) Automatic generation of NC production plans in stamping and laser cutting [J]. CIRP Ann Manuf Technol 40(1):247–250

    Article  Google Scholar 

  6. Pan M, Rao Y (2009) An integrated knowledge based system for sheet metal cutting–punching combination processing [J]. Knowledge-Based Systems Syst 22(5):368–375

    Article  Google Scholar 

  7. Reginald D, Pieter V, Dirk C (2016) A review of cutting path algorithms for laser cutters [J]. J Adv Manuf Technol 87(5-8)

  8. Hajad M, Tangwarodomnukun V, Jaturanonda C, Dumkum C (2019) Laser cutting path optimization with minimum heat accumulation[J]. The International Journal of Advanced Manufacturing Technology 105(5–6):2569–2579

    Article  Google Scholar 

  9. Raggenbass A, Reissner J (1989) Stamping-laser combination in sheet processing [J]. Ann CIRP 38(1):291–294

    Article  Google Scholar 

  10. Manber U, Israni S (1984) Pierce point minimization and optimal torch path determination in flame cutting [J]. Manuf. Syst. 3(1):81–89

    Article  Google Scholar 

  11. Dewil R, Vansteenwegen P, Cattrysse D (2014) Construction heuristics for generating tool paths for laser cutters [J]. Int J Prod Res 52(20):5965–5984

    Article  Google Scholar 

  12. Dewil R, Vansteenwegen P, Cattrysse D, Vossen T, Laguna M (2015) An improvement heuristic framework for the laser cutting tool path problem [J]. Int J Prod Res 53(6):1761–1776

    Article  Google Scholar 

  13. Dewil R (2014) On generating tool paths for laser cutters [J], vol 232.PhD dissertiation, Leuven.

  14. Dewil R, Vansteenwegen P, Cattrysse D (2015) Sheet metal laser cutting tool path generation—dealing with overlooked problem aspects [J]. Key Eng Mater 639:517–524

    Article  Google Scholar 

  15. Lee D, Schachter B (1980) Two algorithms for constructing a Delaunay triangulation [J]. Int J Comp Info Sci 9(3)

  16. Toussaint G, Bhattacharya B (1983) Optimal algorithms for computing the minimum distance between two finite planar sets [J]. North-Holland 2(2)

  17. Prosenjit B, Pat M (2012) Online routing in triangulations [J]. SIAM J Comput 33(4)

  18. Jan G, An O (2014) (n log n) Shortest path algorithm based on Delaunay triangulation [J]. Mechatronics, IEEE/ASME Transactions on 19(2):660–666

    Article  Google Scholar 

  19. Berg M, Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications [M]

  20. Lin Z, Fu J, He Y, Gan W (2013) A robust 2D point-sequence curve offset algorithm with multiple islands for contour-parallel tool path [J]. Computer-Aided Des 45(3)

  21. Sundar M, Nath A, Bandyopadhyay D, Chaudhuri S, Dey P, Misra D (2009) Effect of process parameters on the cutting quality in lasox cutting of mild steel [J]. J Adv Manuf Technol 40(9–10):865–874

    Article  Google Scholar 

Download references

Funding

This work was financially supported by the Natural Science Foundation of Zhejiang Province, China (No. LGG19E050027) and the University Laboratory Research Project of Zhejiang Province, China (No. ZD202001).

Author information

Authors and Affiliations

  1. State Key Laboratory of Fluid Power and Mechatronic Systems, College of Mechanical Engineering, Zhejiang University, Hangzhou, 310027, China

    Qirui Hu, Zhiwei Lin & Jianzhong Fu

  2. Key Laboratory of 3D Printing Process and Equipment of Zhejiang Province, College of Mechanical Engineering, Zhejiang University, Hangzhou, 310027, China

    Qirui Hu, Zhiwei Lin & Jianzhong Fu

Authors
  1. Qirui Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiwei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianzhong Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhiwei Lin.

Ethics declarations

Competing interests

The authors declare no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hu, Q., Lin, Z. & Fu, J. A robust fast bridging algorithm for laser cutting. Int J Adv Manuf Technol 121, 2083–2094 (2022). https://doi.org/10.1007/s00170-022-09465-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-022-09465-w

Keywords

Search

Navigation