New morphological methods to generate two-dimensional curve offsets

Date

2014-04-01

Author

Dölen, Melik
Yaman, Ulaş

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

227
views

0
downloads

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.

Subject Keywords

Curve offset generation, Morphological operations, Boolean operation on polygons, Time complexity analysis

URI

https://hdl.handle.net/11511/37367

Journal

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY

DOI

https://doi.org/10.1007/s00170-013-5595-4

Collections

Department of Mechanical Engineering, Article

Suggestions

OpenMETU
Core

An improved transformation for universal serendipity elements Utku, M (1999-10-01) This paper describes the formulation of shape functions and their derivatives for universal serendipity elements in finite element analysis, which allows for flexibility in locating edge nodes. Universal serendipity elements are defined as isoparametric elements having linear, quadratic and cubic node configurations at their edges in an arbitrary manner. Edge nodes positioned at the same relative distance from corner nodes in both master element and physical element provide improved accuracy over nodes posi...
New design methods for polyhedral linkages Kiper, Gökhan; Söylemez, Eres; Department of Mechanical Engineering (2006) This thesis analyses the existing types of polyhedral linkages and presents new linkage types for resizing polyhedral shapes. First, the transformation characteristics, most specifically, magnification performances of existing polyhedral linkages are given. Then, methods for synthesizing single degree-of-freedom planar polygonal linkages are described. The polygonal linkages synthesized are used as faces of polyhedral linkages. Next, the derivation of some of the existing linkages using the method given is ...
A parallel ant colony optimization algorithm based on crossover operation Kalınlı, Adem; Sarıkoç, Fatih (Springer, 2018-11-01) In this work, we introduce a new parallel ant colony optimization algorithm based on an ant metaphor and the crossover operator from genetic algorithms.The performance of the proposed model is evaluated usingwell-known numerical test problems and then it is applied to train recurrent neural networks to identify linear and nonlinear dynamic plants. The simulation results are compared with results using other algorithms.
New Efficient Algorithms for Multiplication Over Fields of Characteristic Three Cenk, Murat; Hasan, M. Anwar (2018-03-01) In this paper, we first present an enhancement of the well-known Karatsuba 2-way and 3-way algorithms for characteristic three fields, denoted by where nae1. We then derive a 3-way polynomial multiplication algorithm with five 1/3 sized multiplications that use interpolation in . Following the computation of the arithmetic and delay complexity of the proposed algorithm, we provide the results of our hardware implementation of polynomial multiplications over and . The final proposal is a new 3-way polynomial...
A new anisotropic perfectly matched layer medium for mesh truncation in finite difference time domain analysis Tong, MS; Chen, YC; Kuzuoğlu, Mustafa; Mittra, R (1999-09-01) In this paper an unsplit anisotropic perfectly matched layer (PML) medium, previously utilized in the context of finite element analysis, is implemented in the finite difference time domain (FDTD) algorithm. The FDTD anisotropic PML is easy to implement in the existing FDTD codes, and is well suited for truncating inhomogeneous and layered media without special treatment required in the conventional PML approach. A further advantage of the present approach is improved performance at lower frequencies. The a...

Citation Formats

M. Dölen and U. Yaman, “New morphological methods to generate two-dimensional curve offsets,” INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, pp. 1687–1700, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37367.