Towards an evolved lower bound for the most circular partition of a square
Date
2009
Authors
Obermaier, C.
Wagner, M.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the IEEE Congress on Evolutionary Computation, held in Trondheim, Norway on 18-21 May 2009: pp.1463-1469
Statement of Responsibility
Claudia Obermaier and Markus Wagner
Conference Name
IEEE Congress on Evolutionary Computation (2009 : Trondheim, Norway)
Abstract
We examine the problem of partitioning a square into convex polygons which are as circular as possible. Circular means that the polygon's aspect ratio is supposed to be near 1. The aspect ration of a convex polygon denotes the ratio of the diameters of the smallest circumscribing circle to the largest inscribed disk. This problem has been solved for the equilateral triangle as well as for regular k-gon with k > 4. In the case of a square, the optimal solution is still an open problem. We are planning to find a solution which is ldquogood enoughrdquo with the help of evolutionary algorithms.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2009 IEEE