English

A greedy maximal sweepline algorithm for a Jordan curve

Computational Geometry 2026-05-05 v1

Abstract

We give a greedy sweepline algorithm for a Jordan curve and prove that it is maximal in the sense of [1]. Our proof uses K\H{o}nig's lemma.

Cite

@article{arxiv.2605.01861,
  title  = {A greedy maximal sweepline algorithm for a Jordan curve},
  author = {Apurva Mudgal},
  journal= {arXiv preprint arXiv:2605.01861},
  year   = {2026}
}

Comments

4 pages

R2 v1 2026-07-01T12:47:26.478Z