Enhancing genetic search to schedule a production unit
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Motion planning amidst fat obstacles (extended abstract)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
Real-time collision detection for motion simulation within complex environments
SIGGRAPH '96 ACM SIGGRAPH 96 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH '96
Handbook of discrete and computational geometry
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Range Searching and Point Location among Fat Objects
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Exact and approximation algorithms for computing optimal fat decompositions
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
| Hi-index | 0.00 |
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 "good enough" with the help of evolutionary algorithms.