Abstract

The current study is related to the issue of computer-aided reverse engineering. Although the proposed technique has been suggested and adopted for the image-based planar objects, it is extendable to the objects in three dimensions (3D) with some modifications. The objective of the present study is to provide a robust and automated solution and methodology for the applications of reverse engineering technology in manufacturing and other industries. By extracting nearly exact geometric data of the models, the key points (one may call them ‘corner points’) from the data are detected using an efficient technique. Then curve or surface models are fitted by using non-uniform rational B-splines (NURBS). In curve or surface fitting problems, the selection of appropriate parameters, in order to obtain an optimized shape design, is a well-known problem. For large data, this problem needs to be dealt with by optimization algorithms avoiding possible local optima and at the same time reaching the desired solution in an iterative fashion. Many evolutionary optimization techniques including genetic algorithm and simulated annealing have been applied to the problem. This paper presents an application of an evolutionary heuristic technique known as ‘simulated evolution’ (SimE) to the curve and surface fitting problems using NURBS. NURBS have become the standard for representing curves and surfaces. This paper presents a method for approximating NURBS using digitized data. Instead of using the classical optimization approach to solve the problem, a new method based on SimE is developed. The shape parameters, in the description of NURBS, have been targeted to be optimized in a best possible way. The paper describes the mapping scheme of the problem to SimE followed by the proposed algorithm outlines with the interesting results obtained.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.