{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreic6ov4mkpkwfn3p6yfp5andiekbwago2ht22gsywnaxva6b5e2nke",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3ml3dps5k3if2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2605.01861v1",
  "publishedAt": "2026-05-05T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Apurva Mudgal"
  ],
  "textContent": "**Authors:** Apurva Mudgal\n\nWe give a greedy sweepline algorithm for a Jordan curve and prove that it is maximal in the sense of [1]. Our proof uses Kőnig's lemma.",
  "title": "A greedy maximal sweepline algorithm for a Jordan curve"
}