A greedy maximal sweepline algorithm for a Jordan curve

Authors: Apurva Mudgal

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őnig's lemma.