Sciweavers

CEC
2009
IEEE

Towards an evolved lower bound for the most circular partition of a square

14 years 6 months ago
Towards an evolved lower bound for the most circular partition of a square
— 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
Claudia Obermaier, Markus Wagner
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where CEC
Authors Claudia Obermaier, Markus Wagner
Comments (0)