2026-07-26T20:56:37Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:20030 2024-06-06T06:21:17Z ddc:004 open_access

Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid (CG Challenge) Held, Martin Computational Geometry geometric optimization nesting packing algorithm engineering Our work on nesting polygons is based on two key components: (1) a hierarchy of uniform integer grids for maintaining free space within the container during the nesting such that placement queries can be answered reasonably efficiently, and (2) priority heuristics for choosing the order in which the polygons are tested for placement. We discuss our approach and shed a light on the results obtained. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Martin Held 2024 Is Part Of LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2024.85 urn:nbn:de:0030-drops-200306 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.85 eng https://creativecommons.org/licenses/by/4.0/legalcode