Abstract
For the purpose of generating 2D curve offsets used in 2.5D machining, four new methods based on morphological operations on different mathematical entities are presented in this paper. All of the methods, which lend themselves for parallel processing, exploit the idea that the boundaries formed by a circular structuring element whose center sweeps across the points on a generator/base curve comprise the entire offsets of the progenitor. The first approach, which is a carry-over from image processing, makes good use of morphological operations on binary images to produce 2D offsets via contour tracing algorithms. The second method, which is to rectify the high memory cost associated with the former technique, utilizes morphological operations on (boundary data) sets. The implementation of this basic technique is illustrated by two Matlab functions given in the paper. Despite its simplicity, the time complexity of this paradigm is found to be high. Consequently, the third method, which is evolved from the preceding one, reduces the time complexity significantly with the utilization of a geometric range search method. This technique, which has a considerable margin for improvement, is found to be suitable to be used as a part of the real-time motion command generator for CNC applications. Unlike the previous schemes, the final approach uses polygon operations to generate such curves. The run-time of this technique is highly governed by the complexity of the polygon overlay algorithm selected. The paper analyzes the complexity of each technique. Finally, the presented methods are evaluated (in terms of run-time and geometric accuracy) via two test cases where most CAD/CAM packages fail to yield acceptable results.
Similar content being viewed by others
References
Kim HC, Yang MY (2006) An optimum 2.5 D contour parallel tool path. Int J Precis Eng Manuf 8:16–20
Kulkarni P, Marsan A, Dutta D (2000) A review of process planning techniques in layered manufacturing. Rapid Prototyp J 6:18–35
Maekawa T (1999) An overview of offset curves and surfaces. Comput Aided Des 31:165–173
Farouki RT, Shah S (1996) Real-time interpolators for Pythagorean-hodograph curves. Computer Aided Geometric Design 13:583–600
Pottmann H (1995) Rational curves and surfaces with rational offsets. Computer Aided Geometric Design 12:175–192
Elber G, Cohen E (1991) Error bounded variable distance offset operator for free-form curves and surfaces. Int J Comput Geom Appl 1:67–78
Lee IK, Kim MS, Elber G (1996) Planar curve offset based on circle approximation. Comput Aided Des 28:617–630
Maekawa T, Patrikalakis NM (1993) Computation of singularities and intersections of offsets of planar curves. Computer Aided Geometric Design 10:407–429
Maekawa T (1998) Self-intersections of offsets of quadratic surfaces: Part II, implicit surfaces. Eng Comput 14:14–22
Patrikalakis NM, Bardis L (1989) Offsets of curves on rational B-spline surfaces. Eng Comput 5:39–46
Rausch T, Wolter FE, Sniehotta O (1997) Computation of medial curves on surfaces. The Mathematics of Surfaces 7:43–68
Pottmann H (1997) General offset surfaces. Neural, Parallel and Scientific Computations 5:55–80
Brechner EL, (1992) General tool offset curves and surfaces. Geometry processing for design and manufacturing 101–21
Molina-Carmona R, Jimeno A, Davia M (2008) Contour pocketing computation using mathematical morphology. Int J Adv Manuf Technol 36:334–342
Molina-Carmona R, Jimeno-Morenilla AM, Rizo R (2007) Morphological offset computing for contour pocketing. J Manuf Sci Eng 129:400–406
Yaman U, Dolen M (2013) Direct command generation for CNC machinery based on data compression techniques. Robot Comput Integr Manuf 29:344–356
Yaman U, Dolen M, Koku AB (2010) A novel command generation method with variable feedrate utilizing FGPA for motor drives. IEEE 8th Workshop on Intelligent Solutions in Embedded Systems 67–72.
Kim HC (2010) Tool path generation for contour parallel milling with incomplete mesh model. Int J Adv Manuf Technol 48: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:261–271
Serra J (1982) Image analysis and mathematical morphology. Academic, London
Chia TL, Wang KB, Chen LR, Chen Z (2003) A parallel algorithm for generating chain code of objects in binary images. Inf Sci 149:219–234
Chang F, Chen CJ, Lu CJ (2004) A linear-time component-labeling algorithm using contour tracing technique. Comput Vis Image Underst 93:206–220
Meer P, Sher CA, Rosenfeld A (1990) The chain pyramid: hierarchical contour processing. IEEE Transactions on Pattern Analysis and Machine Intelligence 12:363–376
Matoušek J (1994) Geometric range searching. ACM Comput Surv 26:422–461
Agarwal PK, Erickson J (2009) Geometric range searching and its relatives. Contemp Math 223:1–56
Liang YD, Barsky BA (1983) An analysis and algorithm for polygon clipping. Commun ACM 26:868–877
Rivero M, Feito FR (2000) Boolean operations on general planar polygons. Computers & Graphics 24:881–896
Peng Y, Yong JH, Dong WM, Zhang H, Sun JG (2005) A new algorithm for Boolean operations on general polygons. Computers & Graphics 29:57–70
Martínez JG, Rueda AJ, Feito FR (2009) A new algorithm for computing Boolean operations on polygons. Comput Geosci 35:1177–1185
Liu YK, Wang XQ, Bao SZ, Gomboši M, Žalik B (2007) An algorithm for polygon clipping, and for determining polygon intersections and unions. Comput Geosci 33:589–598
Greiner G, Hormann K (1998) Efficient clipping of arbitrary polygons. ACM Trans Graph 17:71–83
Murta A (2012) GPC – General Polygon Clipper Library. http://www.cs.man.ac.uk/~toby/gpc/. Accessed 20 July 2013
Vatti BR (1992) A generic solution to polygon clipping. Commun ACM 35:56–63
Bulbul R, Frank AU (2010) Intersection of non-convex polygons using the alternate hierarchical decomposition. Geospatial thinking 1–23. Spinger-Verlag, Berlin
Liu XZ, Yong JH, Zheng GQ, Sun JG (2007) An offset algorithm for polyline curves. Comput Ind 58:240–254
Zhiwei L, Jianzhong F, Yong H, Wenfeng G (2013) A robust 2D point-sequence curve offset algorithm with multiple islands for contour-parallel tool path. Comput Aided Des 45:657–670
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dolen, M., Yaman, U. New morphological methods to generate two-dimensional curve offsets. Int J Adv Manuf Technol 71, 1687–1700 (2014). https://doi.org/10.1007/s00170-013-5595-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-013-5595-4