CGMar 15
Square packing with $O(x^{0.6})$ wasted area
arXiv:2508.046035.4h-index: 1
Predicted impact top 77% in CG · last 90 daysOriginality Incremental advance
AI Analysis
This addresses a geometric optimization problem in computational geometry, with incremental improvements over existing methods.
The paper tackles the problem of square packing by presenting a new construction that achieves an upper bound of O(x^0.6) wasted area, which is more efficient than prior results.
We show a new construction for square packing, and prove that it is more efficient than previous results.