A greedy maximal sweepline algorithm for a Jordan curve

TL;DR

This paper introduces a greedy sweepline algorithm for Jordan curves and proves its maximality using Kőnig's lemma, contributing a new method in computational geometry.

Contribution

The paper presents a novel greedy sweepline algorithm for Jordan curves and establishes its maximality, advancing algorithmic techniques in geometric analysis.

Findings

The algorithm is proven to be maximal in the sense of prior work.

Kőnig's lemma is used in the proof of maximality.

The approach offers a new perspective on Jordan curve analysis.

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.