A greedy maximal sweepline algorithm for a Jordan curve
arXiv:2605.01861
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Ånig's lemma.
4 pages
arXiv:2605.01861
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.
4 pages