Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This paper advances 2D irregular packing optimization by integrating attention mechanisms into a gradient-based generative framework to solve NP-hard combinatorial problems. The proposed GFPack++ architecture significantly improves space utilization and inference speed while addressing prior limitations in rotation support and boundary adaptability. Such algorithmic refinements are relevant for AI applications in computer graphics, texture generation, and efficient material layout planning.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

GFPack++: Attention-Driven Gradient Fields for Optimizing 2D Irregular Packing

arXiv2 min read

arXiv:2406.07579v2 Announce Type: replace Abstract: 2D irregular packing is a classic combinatorial optimization problem with various applications, such as material utilization and texture atlas generation. Due to its NP-hard nature, conventional numerical approaches typically encounter slow convergence and high computational costs. Previous research (GFPack) introduced a generative method for gradient-based packing, providing early evidence of its feasibility but faced limitations such as insufficient rotation support, poor boundary adaptability, and high overlap ratios. In this paper, we propose GFPack++, a deeply investigated framework that adopts attention-based geometry and relation encoding, enabling more comprehensive modeling of complex packing relationships. We further design a constrained gradient and a weighting function to enhance both the feasibility of the produced solutions and the learning effectiveness. Experimental results on multiple datasets demonstrate that GFPack++ achieves higher space utilization, supports continuous rotation, generalizes well to arbitrary boundaries, and infers orders of magnitude faster than previous approaches. Codes for this paper are at https://github.com/TimHsue/GFPack-pp.

Abstract:2D irregular packing is a classic combinatorial optimization problem with various applications, such as material utilization and texture atlas generation. Due to its NP-hard nature, conventional numerical approaches typically encounter slow convergence and high computational costs. Previous research (GFPack) introduced a generative method for gradient-based packing, providing early evidence of its feasibility but faced limitations such as insufficient rotation support, poor boundary adaptability, and high overlap ratios. In this paper, we propose GFPack++, a deeply investigated framework that adopts attention-based geometry and relation encoding, enabling more comprehensive modeling of complex packing relationships. We further design a constrained gradient and a weighting function to enhance both the feasibility of the produced solutions and the learning effectiveness. Experimental results on multiple datasets demonstrate that GFPack++ achieves higher space utilization, supports continuous rotation, generalizes well to arbitrary boundaries, and infers orders of magnitude faster than previous approaches. Codes for this paper are at this https URL.

14 pages including supplementary material; updated to the ICCV 2025 version with revised title and editorial corrections. Code: this https URL

Artificial Intelligence (cs.AI); Graphics (cs.GR); Machine Learning (cs.LG)

arXiv:2406.07579 [cs.AI]

(or arXiv:2406.07579v2 [cs.AI] for this version)

https://doi.org/10.48550/arXiv.2406.07579 Focus to learn more arXiv-issued DOI via DataCite

Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), 2025, pp. 18014-18023

https://doi.org/10.1109/ICCV51701.2025.01674 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 294 words

Related coverage