Towards an evolved lower bound for the most circular partition of a square
Pages 1463 - 1469
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 "good enough" with the help of evolutionary algorithms.
References
[1]
{Ber97} Marshall W. Bern. Triangulations. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 413-428. CRC Press LLC, 1997.
[2]
{BFM00} Thomas Bäck, David B. Fogel, and Zbigniew Michalewicz, editors. Evolutionary Computation 2: Advanced Algorithms and Operators. Institute of Physics Publishing, Bristol, 2000. contains excerpts from the Handbook of Evolutionary Computation.
[3]
{CD85} Bernard Chazelle and David P. Dopkin. Optimal convex decompositions. In G. T. Toussaint, editor, Computational Geometry, pages 63-133. North-Holland, 1985.
[4]
{CP05} Darren A. Casella and Walter D. Potter. New lower bounds for the snake-in-the-box problem: Using evolutionary techniques to hunt for snakes. In Ingrid Russell and Zdravko Markov, editors, FLAIRS Conference, pages 264-269. AAAI Press, 2005.
[5]
{Dam04} Mirela Damian. Exact and approximation algorithms for computing optimal fat decompositions. Comput. Geom., 28(1):19-27, 2004.
[6]
{DGH06} Pedro A. Diaz-Gomez and Dean F. Hougen. Genetic algorithms for hunting snakes in hypercubes: Fitness function analysis and open questions. In Yeong-Tae Song, Chao Lu, and Roger Lee, editors, SNPD, pages 389-394. IEEE Computer Society, 2006.
[7]
{DIO03} Mirela Damian-Iordache and Joseph O'Rourke. Partitioning regular polygons into circular pieces I: Convex partitions. CoRR, cs.CG/0304023, 2003. informal publication.
[8]
{Fog95} David B. Fogel. Evolutionary Computation: toward a new philosophy of machine intelligence. IEEE Press, 1995.
[9]
{FDFH96} James D. Foley, Andries v. Dam, Steven K. Feiner, and John F. Huges. Computer Graphics: Principles and Practices (2nd edition in C). Addison Wesley, 1996.
[10]
{Fil92} Bogdan Filipic. Enhancing genetic search to schedule a production unit. In ECAI, pages 603-607, 1992.
[11]
{Gol89} David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Reading, Massachusetts, 1989.
[12]
{HKM96} Martin Held, James T. Klosowski, and Joseph S. B. Mitchell. Real-time collision detection for motion simulation within complex environments. In ACM Siggraph Vis. Proc., page 151. ACM, 1996.
[13]
{Hol75} John H. Holland. Adaption in Natural and Artificial Systems. University of Michigan Press, 1975.
[14]
{Kau58} W. H. Kautz. Unit-distance error-checking codes. In IRE Transactions, pages 179-180, 1958.
[15]
{Kei00} J. Mark Keil. Polygon decomposition. In J.-R. Sack and J. Urratia, editors, Handbook of Computational Geometry, pages 491-518. Elsevier, 2000.
[16]
{MS06} C. Mala and S. Selvakumar. Construction of an optimal multicast tree for group communication in a cellular network using genetic algorithm. Computer Communications, 29(16):3306-3312, 2006.
[17]
{OvdS94} Mark H. Overmars and A. Frank van der Stappen. Range searching and point location among fat objects. In European Symposium on Algorithms, pages 240-253, 1994.
[18]
{Rec73} Ingo Rechenberg. Evolutionsstrategie, volume 15 of problemata. Friedrich Frommann Verlag (Günther Holzboog KG), Stuttgart, 1973.
[19]
{vdSO94} A. Frank van der Stappen and Mark H. Overmars. Motion planning amidst fat obstacles (extended abstract). In Symposium on Computational Geometry, pages 31-40, 1994.
- Towards an evolved lower bound for the most circular partition of a square
Recommendations
Rigidity and the Lower Bound Theorem for Doubly Cohen---Macaulay Complexes
We prove that for dź3, the 1-skeleton of any (dź1)-dimensional doubly Cohen---Macaulay (abbreviated 2-CM) complex is generically d-rigid. This implies that Barnette's lower bound inequalities for boundary complexes of simplicial polytopes (Barnette, D. ...
Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes
We prove that for d≥3, the 1-skeleton of any (d−1)-dimensional doubly Cohen–Macaulay (abbreviated 2-CM) complex is generically d-rigid. This implies that Barnette’s lower bound inequalities for boundary complexes of simplicial polytopes (Barnette, D. ...
Comments
Information & Contributors
Information
Published In
May 2009
3356 pages
ISBN:9781424429585
Publisher
IEEE Press
Publication History
Published: 18 May 2009
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025