A Sweep-Line Algorithm and Its Application to Spiral Pocketing

  • Published : 2002.12.31

Abstract

This paper presents an efficient line-offset algorithm for general polygonal shapes with islands. A developed sweep-line algorithm (SL) is introduced to find all self-intersection points accurately and quickly. The previous work is limited to handle polygons that having no line-segments in parallel to sweep-line directions. The proposed algorithm has been implemented in Visual C++ and applied to offset point sequence curves, which contain several islands.

Keywords

References

  1. Bentley, J. L. and Ottmann, T. A. (1979), 'Algorithms for reporting and counting geometric intersections', IEEE Transactions on Computers, 643-647
  2. Chazelle, B. and Edelsbrunner, H. (1992), 'An Optimal algorithm for intersecting line segments in the plane', Journal of the Association for computing machinery, 39(1), 1-54
  3. Chen, Y.J. and Ravani B. (1987), 'Offset surface generation and contouring in computer-aided design', Journal of Mechanisms, Transmissions and Automation in Design: ASME Transactions, 109(3),133-142
  4. Choi, B.K. and Kim, B.H. (1997), 'Die-cavity pocketing via cutting simulation', Computer Aided Design, 29(12), 837-846
  5. Choi, B.K. and Park, S.C. (1999), 'A pair-wise offset algorithm for 2D point-sequence curve', Computer-Aided Design-31, 735-745
  6. Dobkin, D., Guibas, L., Hershberger, J. and Snoeyink, J. (1988), 'An Efficient algorithm for finding the CSG representation of a simple polygon', Computer Graphics, 31-40
  7. Gavrilova, M. and Rokne J.G. (2000), 'Reliable line segment intersection testing', Computer Aided Design, 737-745
  8. Hansen, A. and Arbab, F. (1992), 'An algorithm for generating NC tool paths for arbitrarily shaped pockets with islands', ACM Transactions on Graphics, 11(2), 152-182
  9. Held, M. (1991), On the computational geometry of pocket machining, Berlin, Germany: Springer-Verlag
  10. Held, M. (2001), 'VRONI: An Engineering Approach to the Reliable and Efficient Computation of Voronoi Diagrams of Points and Line Segments', CGTA
  11. Internet web-site (IWS-1), 'Algorithms for Intersecting Segments' and
  12. Internet web-site (IWS-2), 'An efficient algorithm for calculating red and blue line segment intersections' -site,
  13. Kalmanovichf, G. and Nisnevich, G. (1998), 'Swift and stable polygon growth and broken line offset', Computer-Aided Design, 30(11), 847-852
  14. Kuragano, T., Sasaki, N., and Kikuchi, A. (1988), 'The FRESDAM system for designing and manufacturing freeform objects', In: Martin R, editor. USA-Japan Cross Bridge. Flexible Automation, 93-100
  15. Li, H., Dong Z., and Vickers, G. W. (1998), 'Optimal Tool Path Generation for 2V2-D Milling of Dies and 2$\frac{1}{2}$-D Milling of Dies and Molds', SSM'98 Sculptured Surface Machining Conference
  16. Mehlhorn, K. and Naber, S. (1994), 'An Implementation of a sweep line algorithm for the straight line segment intersection problem', Technical Report No. MPI-I-94-160. Max-Planck-Institut fur Informatik
  17. Park, S.C., Shin H., and Choi B.K. (1998), 'A sweep line algorithm for polygonal chain intersection and its applications', Proceedings of IFlP WG5.2 GEO-6 Conference in Tokyo University, 187-195
  18. Pham, B. (1992), 'Offset curves and surfaces: a brief survey', Computer Aided Design, 24(4), 223-231
  19. Preparata, F.P. and Shames, M.I. (1985), 'Computational geometry-An introduction', Springer Verlag, New York
  20. Rohmfeld, R.F. (1998), 'IGB-offset curves-loop removal by scanning of interval sequences', Computer Aided Geometric Design, 15(3), 339-375
  21. Schrder, P. (CS138A 1999), 'Line Segment Inter-section'
  22. Takashi, M. (1999), 'An overview of offset curves and surfaces', Computer Aided Design, 165-173
  23. Yang, S.N. and Huang, M.L. (1993), 'A new offset algorithm based on tracing technique', Second ACM/IEEE Symposium on Solid Modeling and Applications, Montreal, Canada, 201-210