@InProceedings{atak_et_al:LIPIcs.SoCG.2024.83,
author = {Atak, Alkan and Buchin, Kevin and Hagedoorn, Mart and Heinrichs, Jona and Hogreve, Karsten and Li, Guangping and Pawelczyk, Patrick},
title = {{Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, Genetic Algorithms and ILPs}},
booktitle = {40th International Symposium on Computational Geometry (SoCG 2024)},
pages = {83:1--83:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-316-4},
ISSN = {1868-8969},
year = {2024},
volume = {293},
editor = {Mulzer, Wolfgang and Phillips, Jeff M.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.83},
URN = {urn:nbn:de:0030-drops-200283},
doi = {10.4230/LIPIcs.SoCG.2024.83},
annote = {Keywords: Polygon Packing, Nesting Problem, Genetic Algorithm, Integer Linear Programming}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode