Square Packing with Asymptotically Smallest Waste Only Needs Good Squares

Documenti analoghi

• Square packing with $O(x^{0.6})$ wasted area
  di: Bui, Hong Duc
  Pubblicazione: (2025)
• Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
  di: Abrahamsen, Mikkel, et al.
  Pubblicazione: (2024)
• Optimally Packing a Large Square by Unit Squares
  di: McClenagan, Rory
  Pubblicazione: (2026)
• Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials
  di: Bui, Hong Duc
  Pubblicazione: (2025)
• Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O(n^{1.032})$ Area
  di: Bui, Hong Duc
  Pubblicazione: (2025)