Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
128
click to vote
CEC
2009
IEEE
93
views
Artificial Intelligence
»
more
CEC 2009
»
Towards an evolved lower bound for the most circular partition of a square
15 years 9 months ago
Download
www.uni-koblenz.de
— 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
Real-time Traffic
Artificial Intelligence
|
CEC 2009
|
Convex Polygons
|
Polygon’s Aspect Ratio
|
claim paper
Post Info
More Details (n/a)
Added
20 May 2010
Updated
20 May 2010
Type
Conference
Year
2009
Where
CEC
Authors
Claudia Obermaier, Markus Wagner
Comments
(0)
Researcher Info
Artificial Intelligence Study Group
Computer Vision