3 papers
cs.CG2026
Covering and Partitioning Complex Objects with Small Pieces
Anders Aamand, Mikkel Abrahamsen, Reilly Browne +6
We study the problems of covering or partitioning a polygon (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contain…
cs.CG2025
Bounding a Polygon by a Minimum Number of Vertices
Mikkel Abrahamsen, Jack Stade, Shuyi Yan +1
Suppose that a polygon is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we n…
cs.CG2024
Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
Mikkel Abrahamsen, Kevin Buchin, Maike Buchin +5
We study two well-known reconfiguration problems. Given a start and a target configuration of geometric objects in a polygon, we wonder whether we can move the objects from the sta…