Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/76748
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Towards an evolved lower bound for the most circular partition of a square |
Author: | Obermaier, C. Wagner, M. |
Citation: | Proceedings of the IEEE Congress on Evolutionary Computation, held in Trondheim, Norway on 18-21 May 2009: pp.1463-1469 |
Publisher: | IEEE |
Publisher Place: | Norway |
Issue Date: | 2009 |
ISBN: | 9781424429592 |
Conference Name: | IEEE Congress on Evolutionary Computation (2009 : Trondheim, Norway) |
Statement of Responsibility: | Claudia Obermaier and Markus Wagner |
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. |
Keywords: | Artificial intelligence computational geometry evolutionary computation motion detection partitioning algorithms performance evaluation polynomials ray tracing testing virtual reality |
Rights: | © 2009 IEEE |
DOI: | 10.1109/CEC.2009.4983115 |
Published version: | http://dx.doi.org/10.1109/cec.2009.4983115 |
Appears in Collections: | Aurora harvest 4 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.