Cover Image

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abrahamsen, Mikkel, Stade, Jack
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bounding a Polygon by a Minimum Number of Vertices
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Minimum Star Partitions of Simple Polygons in Polynomial Time
by: Abrahamsen, Mikkel, et al.
Published: (2023)

Partitioning a Polygon Into Small Pieces
by: Abrahamsen, Mikkel, et al.
Published: (2022)

Online Sorting and Translational Packing of Convex Polygons
by: Aamand, Anders, et al.
Published: (2021)

Covering and Partitioning Complex Objects with Small Pieces
by: Aamand, Anders, et al.
Published: (2026)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
by: Abrahamsen, Mikkel, et al.
Published: (2020)

Two Tiling is Undecidable
by: Stade, Jack
Published: (2025)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
by: Abrahamsen, Mikkel, et al.
Published: (2024)

The Point-Boundary Art Gallery Problem is $\exists\mathbb{R}$-hard
by: Stade, Jack
Published: (2022)

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Ten Problems in Geobotics
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Covering Simple Orthogonal Polygons with Rectangles
by: Roy, Aniket Basu
Published: (2024)

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
by: Dhar, Anubhav, et al.
Published: (2024)

Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)

Shadoks Approach to Knapsack Polygonal Packing
by: da Fonseca, Guilherme D., et al.
Published: (2024)

Optimally Packing a Large Square by Unit Squares
by: McClenagan, Rory
Published: (2026)

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

NP-membership for the boundary-boundary art-gallery problem
by: Stade, Jack
Published: (2025)

Computing Non-Obtuse Triangulations with Few Steiner Points
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Minimum Partition of Polygons under Width and Cut Constraints
by: Chung, Jaehoon, et al.
Published: (2025)

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
by: Bui, Hong Duc
Published: (2025)

Multirobot Watchman Routes in a Simple Polygon
by: Mitchell, Joseph S. B., et al.
Published: (2024)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
by: Damian, Mirela, et al.
Published: (2003)

Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
by: Biedl, Therese, et al.
Published: (2024)

Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)

Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)

The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving
by: Robson, Eliot W., et al.
Published: (2024)

Hardness and Approximation Schemes for Discrete Packing and Domination
by: Madireddy, Raghunath Reddy, et al.
Published: (2025)

Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds
by: Chung, Jaehoon
Published: (2026)

Convex Covering Using Collections of Convex Polygons and Set Cover
by: da Fonseca, Guilherme D.
Published: (2023)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)

Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
by: de Berg, Mark, et al.
Published: (2024)

Simple Grid Polygon Online Exploration Revisited
by: Brock, Maximilian, et al.
Published: (2024)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
by: Fekete, Sándor P., et al.
Published: (2024)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Packings of Smoothed Polygons
by: Hales, Thomas, et al.
Published: (2024)

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
by: Barequet, Gill, et al.
Published: (2025)

Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
by: Spalding-Jamieson, Jack
Published: (2025)

Improved Hardness of Approximation for Geometric Bin Packing
by: Ray, Arka, et al.
Published: (2023)