{
  "domain": "computer-science",
  "topics": [
    "computational-geometry",
    "algorithms-complexity"
  ],
  "type": "proof",
  "also": [
    "algorithm"
  ],
  "cover": {
    "motif": "points",
    "n": 8
  },
  "source": {
    "key": "topp",
    "name": "The Open Problems Project",
    "url": "https://topp.openproblem.net/p49",
    "id": "49",
    "curator": "Erik D. Demaine, Joseph S. B. Mitchell and Joseph O'Rourke",
    "poser": "Alexander Barvinok; Sándor P. Fekete (NP-hardness conjecture)",
    "status": "open",
    "as_of": "2026-10-20",
    "catalog": "0521c19bbd38"
  }
}