{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreif3uyanw3effckzwdeclqlrwsh6vrsegmhaeaeptxsy6ifrqiu22m",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mfbblphyfg42"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2602.17294v1",
  "publishedAt": "2026-02-20T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Delia Garijo",
    "Alberto Márquez",
    "Rodrigo I. Silveira"
  ],
  "textContent": "**Authors:** Delia Garijo, Alberto Márquez, Rodrigo I. Silveira\n\nWe show that two geometric cover problems in the plane, related to covering points with disjoint line segments, are NP-complete. Given $n$ points in the plane and a value $k$, the first problem asks if all points can be covered by $k$ disjoint line segments; the second problem treats the analogous question for $k$ guillotine cuts.",
  "title": "On the complexity of covering points by disjoint segments and by guillotine cuts"
}