Cuckoo Search Algorithm with Lévy Flights for Global-Support Parametric Surface Approximation in Reverse Engineering

This paper concerns several important topics of the Symmetry journal, namely, computer-aided design, computational geometry, computer graphics, visualization, and pattern recognition. We also take advantage of the symmetric structure of the tensor-product surfaces, where the parametric variables u and v play a symmetric role in shape reconstruction. In this paper we address the general problem of global-support parametric surface approximation from clouds of data points for reverse engineering applications. Given a set of measured data points, the approximation is formulated as a nonlinear continuous least-squares optimization problem. Then, a recent metaheuristics called Cuckoo Search Algorithm (CSA) is applied to compute all relevant free variables of this minimization problem (namely, the data parameters and the surface poles). The method includes the iterative generation of new solutions by using the Lévy flights to promote the diversity of solutions and prevent stagnation. A critical advantage of this method is its simplicity: the CSA requires only two parameters, many fewer than any other metaheuristic approach, so the parameter tuning becomes a very easy task. The method is also simple to understand and easy to implement. Our approach has been applied to a benchmark of three illustrative sets of noisy data points corresponding to surfaces exhibiting several challenging features. Our experimental results show that the method performs very well even for the cases of noisy and unorganized data points. Therefore, the method can be directly used for real-world applications for reverse engineering without further pre/post-processing. Comparative work with the most classical mathematical techniques for this problem as well as a recent modification of the CSA called Improved CSA (ICSA) is also reported. Two nonparametric statistical tests show that our method outperforms the classical mathematical techniques and provides equivalent results to ICSA for all instances in our benchmark.This research work has received funding from the project PDE-GIR (Partial Differential Equations for Geometric modelling, Image processing, and shape Reconstruction) of the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant agreement No. 778035, the Spanish Ministry of Economy and Competitiveness (Computer Science National Program) under Grant #TIN2017-89275-R of the Agencia Estatal de Investigación and European Funds FEDER (AEI/FEDER, UE), and the project #JU12, jointly supported by public body SODERCAN of the Regional Government of Cantabria and European Funds FEDER (SODERCAN/FEDER UE). We also thank Toho University, Nihon University, and the Symmetry 2018, 10, 58 23 of 25 University of Cantabria for their support to conduct this research wor

Efek Diskritisasi pada Modifikasi Hypocycloid Menjadi CSCPP (Curve Stitching Connected Pseudo Polygon)

Tulisan ini membahas tentang pembuatan Curve Stitching berdasarkan efek diskritisasi kurva Hypocycloid yang dimodifikasi. Kurva yang dihasilkan dinamakan Connected Pseudo Polygon (CPP) karena berupa segibanyak yang berbentuk berdasarkan urutan cara menggambar serta diskritisasi titik yang digunakan. Yang dimaksud Curve Stitching disini adalah pembuatan ornamen dengan papan dan benang. Desain ini digunakan sebagai media bermain dalam kegiatan pelajaran atau kuliah matematika. Selain dengan benang, CPP juga dibentuk dengan kawat dan sedotan agar Desain yang sama dapat dibentuk dengan beberapa material yang cocok untuk penyusunan CPP. CPP ini digunakan sebagai media untuk mengilustrasikan inovasi matematika atau ornamen matematika

Cuckoo search algorithm for construction site layout planning

A novel metaheuristic optimization algorithm based on cuckoo search algorithm (CSA) is presented to solve the construction site layout planning problem (CSLP). CSLP is a complex optimization problem with various applications, such as plant layout, construction site layout, and computer chip layout. Many researchers have investigated the CSLP by applying many algorithms in an exact or heuristic approach. Although both methods yield a promising result, technically, nature-inspired algorithms demonstrate high achievement in successful percentage. In the last two decades, researchers have been developing a new nature-inspired algorithm for solving different types of optimization problems. The CSA has gained popularity in resolving large and complex issues with promising results compared with other nature-inspired algorithms. However, for solving CSLP, the algorithm based on CSA is still minor. Thus, this study proposed CSA with additional modification in the algorithm mechanism, where the algorithm shows a promising result and can solve CSLP cases.publishedVersionPeer reviewe