CGMay 3
A greedy maximal sweepline algorithm for a Jordan curve
arXiv:2605.018619.7
Predicted impact top 75% in CG · last 90 daysOriginality Synthesis-oriented
AI Analysis
This work provides a theoretical result for computational geometry, but the problem is niche and the contribution is incremental.
The paper presents a greedy sweepline algorithm for a Jordan curve and proves its maximality using Kőnig's lemma, establishing a theoretical property of the algorithm.
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.