An evolutionary algorithm for generating planar developments of arbitrarily curved surfaces

Authors:
Phillip N. Azariadis;Andreas C. Nearchou;Nikos A. Aspragathos
Affiliations:
Mechanical Engineering and Aeronautics Department, University of Patras, 26 500 Patras, Greece;Mechanical Engineering and Aeronautics Department, University of Patras, 26 500 Patras, Greece and Business Administration Department, University of Patras, 26 500 Patras, Greece;Mechanical Engineering and Aeronautics Department, University of Patras, 26 500 Patras, Greece
Venue:
Computers in Industry
Year:
2002

Citing 5
Cited 3

Piecewise surface flattening for non-distorted texture mapping

Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Interactive texture mapping

SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

A simplified algorithm for planar development of 3D surface and its application in the blank design of sheet metal forming

Finite Elements in Analysis and Design
A New Self-adaptative Crossover Operator for Real-Coded Evolutionary Algorithms

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Pattern flattening for orthotropic materials

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new method based on constrained global optimization is proposed for generating planar developments of arbitrarily three-dimensional surfaces. With this method an initial planar development is derived which is refined in order to satisfy certain criteria. This refinement is formulated as a global minimization problem under constraints. Generally, the constraints are used to control the local accuracy in the derived planar development. The overall minimization problem is resolved using a real-coded genetic algorithms (GA), which is developed for resolving multi-dimensional minimization problems. Indicative applications are presented to illustrate the effectiveness of the proposed method.