Journal of the Korean Society for Precision Engineering (한국정밀공학회지)

Korean Society for Precision Engineering (한국정밀공학회)
권호 표지

Tool-Path Generation using Sweep line Algorithm

스윕라인 알고리즘을 이용한 공구경로의 생성

  • Published : 2009.01.01
Download PDF
⟨ Previous Next ⟩

Abstract

Proposed in the paper is an algorithm to generate tool-path for sculptured surface machining. The proposed algorithm computes tool path by slicing offset triangular mesh, which is the CL-surface (Cutter Location surface). Since the offset triangular mesh includes invalid triangles and self-intersections, it is necessary to remove invalid portions. For the efficient removal of the invalid portions, we extended the sweep line algorithm. The extended sweep line algorithm removes invalid portions very efficiently, and it also considers various degeneracy cases including multiple intersections and overlaps. The proposed algorithm has been implemented and tested with various examples.

Keywords

References

  1. Choi, B. K. and Jerard, R. B., "Sculptured Surface Machining," Kluwer, 1998
  2. Shamos, M. I. and Hoey, D. J., "Geometric intersection problems," Seventeeth Annual IEEE Symposium on Foundations of Computer Science, pp. 208-215, 1976 https://doi.org/10.1109/SFCS.1976.16
  3. Preparata, F. P. and Shamos, M. I., "Computational geometry: An introduction," Springer, 1985
  4. Moller, T., "A fast triangle-triangle intersection test," Journal of Graphics Tools, Vol. 2, No. 2, pp. 25-30,1997 https://doi.org/10.1080/10867651.1997.10487472
  5. Jiménez, P., Thomas, F. and Torras, C., "3D collision detection: a survey," Computers & Graphics, Vol. 25, Issue 2, pp. 269-285, 2001 https://doi.org/10.1016/S0097-8493(00)00130-8
  6. Held, M., "On the Computational Geometry of Pocket Machining," Springer-Verlag, 1991
  7. Park, S. C. and Shin, H., "Polygonal Chain intersection," Computers & Graphics, Vol. 25, Issue 2, pp. 341-350, 2002 https://doi.org/10.1016/S0097-8493(02)00060-2
  8. Park, S. C. and Choi, B. K., "Tool-path planning for direction-parallel area milling," Computer Aided Design, Vol. 32, No. 1, pp. 17-25, 2000 https://doi.org/10.1016/S0010-4485(99)00080-9
  9. Park, S. C. and Choi, B. K., 'Boundary extraction algorithm for cutting area detection,' Computer Aided Design, Vol. 33, Issue 8, pp. 571-579, 2001 https://doi.org/10.1016/S0010-4485(00)00101-9
  10. Choi, B. K. and Park, S. C., "A pair-wise offset algorithm for 2D point-sequence curve," Computer Aided Design, Vol. 31, No. 12, pp. 735-745, 1999 https://doi.org/10.1016/S0010-4485(99)00060-3
  11. Park, S. C. and Choi, B. K., "Uncut-free pocketingtool-paths generation using pair-wise offsetalgorithm," Computer Aided Design, Vol. 33, Issue10, pp. 739-746, 2001 https://doi.org/10.1016/S0010-4485(00)00109-3
  12. Park, S. C. and Chung, Y. C., "Offset tool-path linking for pocket machining," Computer Aided Design, Vol. 34, No. 4, pp. 299-308, 2002 https://doi.org/10.1016/S0010-4485(01)00088-4
  13. Bentley, J. L. and Ottmann, T. A., "Algorithms for reporting and counting geometric intersections," Computers IEEE Transactions on, Vol. 28, No. 9, pp.643-647, 1979 https://doi.org/10.1109/TC.1979.1675432
  14. Chandru, V., Rajan, V. T. and Swaminathan, R., "Monotone pieces of chains," ORSA Journal On Computing, Vol. 4, No. 4, pp. 439-446, 1992 https://doi.org/10.1287/ijoc.4.4.439