Computational procedure for optimum shape design based on chained Bezier surfaces parameterization

  • Authors:
  • Damir Vucina;Zeljan Lozina;Igor Pehnec

  • Affiliations:
  • University of Split, FESB, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, R.Boskovica bb, 21000 Split, Croatia;University of Split, FESB, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, R.Boskovica bb, 21000 Split, Croatia;University of Split, FESB, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, R.Boskovica bb, 21000 Split, Croatia

  • Venue:
  • Engineering Applications of Artificial Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Optimum design introduces strong emphasis on compact geometry parameterization in order to reduce the dimensionality of the search space and consequently optimization run-time. This paper develops a decision support system for optimum shape which integrates geometric knowledge acquisition using 3D scanning and evolutionary shape re-engineering by applying genetic-algorithm based optimum search within a distributed computing workflow. A shape knowledge representation and compaction method is developed by creating 2D and 3D parameterizations based on adaptive chaining of piecewise Bezier curves and surfaces. Low-degree patches are used with adaptive subdivision of the target domain, thereby preserving locality. C^1 inter-segment continuity is accomplished by generating additional control points without increasing the number of design variables. The control points positions are redistributed and compressed towards the sharp edges contained in the data-set for better representation of areas with sharp change in slopes and curvatures. The optimal decomposition of the points cloud or target surface into patches is based on the requested modeling accuracy, which works as lossy geometric data-set compression. The proposed method has advantages in non-recursive evaluation, possibility of chaining patches of different degrees, options of prescribing fixed values at selected intermediate points while maintaining C^1 continuity, and uncoupled processing of individual patches. The developed procedure executes external application nodes using mutual communication via native data files and data mining. This adaptive interdisciplinary workflow integrates different algorithms and programs (3D shape acquisition, representation of geometry with data-set compaction using parametric surfaces, geometric modeling, distributed evolutionary optimization) such that optimized shape solutions are synthesized. 2D and 3D test cases encompassing holes and sharp edges are provided to prove the capacity and respective performance of the developed parameterizations, and the resulting optimized shapes for different load cases demonstrate the functionality of the overall distributed workflow.