New morphological methods to generate two-dimensional curve offsets

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.

[1]  Gershon Elber,et al.  Planar curve offset based on circle approximation , 1996, Comput. Aided Des..

[2]  Rafael Molina-Carmona,et al.  Morphological offset computing for contour pocketing , 2007 .

[3]  Ahmed K. Noor,et al.  Error indicators and accuracy improvement of finite element solutions , 1988 .

[4]  Zhiwei Lin,et al.  A robust 2D point-sequence curve offset algorithm with multiple islands for contour-parallel tool path , 2013, Comput. Aided Des..

[5]  Brian A. Barsky,et al.  An analysis and algorithm for polygon clipping , 1983, CACM.

[6]  Nicholas M. Patrikalakis,et al.  Computation of singularities and intersections of offsets of planar curves , 1993, Comput. Aided Geom. Des..

[7]  Borut Zalik,et al.  An algorithm for polygon clipping, and for determining polygon intersections and unions , 2007, Comput. Geosci..

[8]  Günther Greiner,et al.  Efficient clipping of arbitrary polygons , 1998, TOGS.

[9]  Jun-Hai Yong,et al.  A new algorithm for Boolean operations on general polygons , 2005, Comput. Graph..

[10]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[11]  Bala R. Vatti A generic solution to polygon clipping , 1992, CACM.

[12]  Debasish Dutta,et al.  A review of process planning techniques in layered manufacturing , 2000 .

[13]  A. Bugra Koku,et al.  A novel command generation method with variable feedrate utilizing FGPA for motor drives , 2010, 2010 8th Workshop on Intelligent Solutions in Embedded Systems.

[14]  Jun-Hai Yong,et al.  An offset algorithm for polyline curves , 2007, Comput. Ind..

[15]  N. M. Patrikalakis,et al.  Offsets of curves on rational B-spline surfaces , 2005, Engineering with Computers.

[16]  Yuhong Liu P. Renard, H. Demougeot-Renard, R. Froidevaux, Editors, , Geostatistics for Environmental Applications, Proceedings of the Fifth European Conference on Geostatistics for Environmental Applications (2006) Springer, New York (480pp., US$169, Hardbound, ISBN: 3-540-26533-3) , 2007, Comput. Geosci..

[17]  Pankaj K. Agarwal,et al.  Geometric Range Searching and Its Relatives , 2007 .

[18]  M. Davia,et al.  Contour pocketing computation using mathematical morphology , 2008 .

[19]  Chun-Jen Chen,et al.  A linear-time component-labeling algorithm using contour tracing technique , 2004, Comput. Vis. Image Underst..

[20]  Hyun-Chul Kim,et al.  An Optimum 2.5D Contour Parallel Tool Path , 2006 .

[21]  Takashi Maekawa,et al.  An overview of offset curves and surfaces , 1999, Comput. Aided Des..

[22]  Francisco R. Feito-Higueruela,et al.  Boolean operations on general planar polygons , 2000, Comput. Graph..

[23]  Hyun-Chul Kim,et al.  Tool path generation for contour parallel milling with incomplete mesh model , 2010 .

[24]  Gershon Elber,et al.  Error bounded variable distance offset operator for free form curves and surfaces , 1991, Int. J. Comput. Geom. Appl..

[25]  Alan Murta,et al.  GPC: General Polygon Clipper library , 2015 .

[26]  Jirí Matousek,et al.  Geometric range searching , 1994, CSUR.

[27]  Zen Chen,et al.  A parallel algorithm for generating chain code of objects in binary images , 2003, Inf. Sci..

[28]  Azriel Rosenfeld,et al.  The Chain Pyramid: Hierarchical Contour Processing , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Sanjay Govindjee,et al.  Accuracy and stability for integration of Jaumann stress rate equations in spinning bodies , 1997 .

[30]  Helmut Pottmann,et al.  General offset surfaces , 1997, Neural Parallel Sci. Comput..

[31]  Rida T. Farouki,et al.  Real-time CNC interpolators for Pythagorean-hodograph curves , 1996, Comput. Aided Geom. Des..

[32]  Melik Dolen,et al.  Direct command generation for CNC machinery based on data compression techniques , 2013 .

[33]  Takashi Maekawa,et al.  Self-intersections of offsets of quadratic surfaces: Part II, implicit surfaces , 1998, Engineering with Computers.

[34]  Yuwen Sun,et al.  Contour-parallel offset machining for trimmed surfaces based on conformal mapping with free boundary , 2012 .

[35]  Helmut Pottmann,et al.  Rational curves and surfaces with rational offsets , 1995, Comput. Aided Geom. Des..

[36]  Francisco R. Feito-Higueruela,et al.  A new algorithm for computing Boolean operations on polygons , 2009, Comput. Geosci..