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.
生成讲解博客的中文版本
生成AI智能校验的中文版本