Abstract
Two-dimensional curve offsets have a wide application area ranging from manufacturing to medical imaging. To that end, this paper concentrates on two novel techniques to produce planar curve offsets. Both methods, which are based on mathematical morphology, employ the concept that the boundaries formed by a circular structuring element whose center moves across the points on a base curve comprise the entire offsets of the progenitor. The first technique titled IMOBS was introduced in our former paper and was shown to have superior properties in terms of its high accuracy, low computational complexity, and its ability to handle complex curves if compared to the techniques available in the literature. Consequently, an all-purpose algorithm titled AMOBS is introduced to enhance further the performance of the former technique by making good use of gradient information to find globally the most suitable candidate points in the boundary data set via grid search techniques. Thus, the new paradigm is demonstrated to overcome some of the problems (like orphan curve offsets) encountered in extreme cases. Both algorithms, which have similar attributes in terms of run-time complexity and memory cost, are comparatively tested via two experimental cases where most CAD/CAM packages fail to yield acceptable results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hung JP, Lai YL (2012) Wide roller guide machining by four-axis machine tools for cylindrical cams. Int J Adv Manuf Technol 62(9–12):923–932
Jin J, Tang L (2011) Coverage path planning on three‐dimensional terrain for arable farming. J Field Robot 28(3):424–440
Liling G, Yingjie Z (2008) New approach to computation of offset curves for point-based geometries. 3rd IEEE Conf Ind Electron Appl 367–371
Pishchulin L, Jain A, Wojek C, Andriluka M, Thormahlen T, Schiele, B (2011) Learning people detection models from few training samples. IEEE Conf Comput Vision Pattern Recog 1473–1480
Maekawa T (1999) An overview of offset curves and surfaces. Comput Aided Des 31(3):165–173
Dhanik S, Xirouchakis P (2010) Contour parallel milling tool path generation for arbitrary pocket shape using a fast marching method. Int J Adv Manuf Technol 50:1101–1111
Choi BK, Park SC (1999) A pair-wise offset algorithm for 2D point-sequence curve. Comput Aided Des 31(12):735–745
Bentley JL, Ottmann TA (1979) Algorithms for reporting and counting geometric intersections. IEEE Trans Comput 100(9):643–647
Lai YL, Wu JSS, Hung JP, Chen JH (2006) A simple method for invalid loops removal of planar offset curves. Int J Adv Manuf Technol 27(11–12):1153–1162
Seong JK, Elber G, Kim MS (2006) Trimming local and global self-intersections in offset curves/surfaces using distance maps. Comput Aided Des 38(3):183–193
Pekerman D, Elber G, Kim MS (2008) Self-intersection detection and elimination in freeform curves and surfaces. Comput Aided Des 40(2):150–159
Lee CS, Phan TT, Kim DS (2009) 2D curve offset algorithm for pockets with islands using a vertex offset. Int J Precis Eng Manuf 10(2):127–135
Kim HC (2010) Tool path generation for contour parallel milling with incomplete mesh model. Int J Adv Manuf Technol 48(5–8):443–454
Sun Y, Ren F, Zhu X, Guo D (2012) Contour-parallel offset machining for trimmed surfaces based on conformal mapping with free boundary. Int J Adv Manuf Technol 60(1–4):261–271
Lin Z, Fu J, He Y, Gan W (2012) A robust 2D point-sequence curve offset algorithm with multiple islands for contour-parallel tool path. Comput Aided Des 45:657–670
Laskar MNU, Choi SY, Ahmed I, Chung T (2013) Geometric modeling of any obstacle shapes for robot motion planning. Intell Robot Appl 693–705
Choi BK, Kim BH (1997) Die-cavity pocketing via cutting simulation. Comput Aided Des 29(12):837–846
Chamberlain PB (2004) Discrete algorithms for machining and rapid prototyping based on image processing. Ph.D. Dissertation, University of Utah
Jimeno AM, Macía F, García-Chamizo J (2004) Trajectory-based morphological operators: a morphological model for tool path computation. Proc Inte Conf Algorithmic Math Comput Sci
Molina-Carmona R, Jimeno-Morenilla AM, Rizo R (2007) Morphological offset computing for contour pocketing. J Manuf Sci Eng 129:400–406
Dolen M, Yaman U (2014) New morphological methods to generate two dimensional curve offsets. Int J Adv Manuf Technol 71:1687–1700
Yaman U, Mutlu BR, Dolen M, Koku AB (2009) Direct command generation methods for servo-motor drives. IEEE 12th Int Conf Electr Mach Syst
Yaman U, Dolen M (2013) Direct command generation for CNC machinery based on data compression techniques. Robot Comput Integr Manuf 29(2):344–356
Agarwal PK, Erickson J (1999) Geometric range searching and its relatives. Contemp Math 223:1–56
Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT Press, Cambridge
De Berg M, Cheong O, Van Kreveld M, Overmars M (2008) Computational geometry, 3rd edn. Springer, Berlin
Liu XZ, Yong JH, Zheng GQ, Sun JG (2007) An offset algorithm for polyline curves. Comput Ind 58:240–254
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yaman, U., Dolen, M. A gradient-based morphological method to produce planar curve offsets. Int J Adv Manuf Technol 80, 255–274 (2015). https://doi.org/10.1007/s00170-015-6971-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-015-6971-z