{
  "annotation_id": "0af39ed3-0e16-4cc0-906e-f8cf15ec1de0",
  "date_created": "2026-02-17T05:53:16.031000Z",
  "date_modified": "2026-02-17T05:53:16.031000Z",
  "file_hash": "43f9ea373e732e009815a5e816527a265989fc87e00470848e6b924e74928e1e",
  "private": false,
  "record": {
    "abstract": "We study the problem of finding neck-like features on a surface. Applications for such cuts include robotics, mesh segmentation, and algorithmic applications. We provide a new definition for a surface bottleneck -- informally, it is the shortest cycle relative to the size of the areas it separates. Inspired by the isoperimetric inequality, we formally define such optimal cuts, study their properties, and present several algorithms inspired by these ideas that work surprisingly well in practice. For examples of our algorithms, see https://neckcut.space.",
    "arxiv_id": "2601.08566",
    "authors": [
      "Sam Ruggerio",
      "Sariel Har-Peled"
    ],
    "categories": [
      "cs.CG"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "In the Search for Good Neck Cuts",
    "url": "https://arxiv.org/abs/2601.08566",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "69f787b4-d0c3-4130-aa60-19683d5fa920",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}