A greedy maximal sweepline algorithm for a Jordan curve
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909011427721216 |
|---|---|
| author | Mudgal, Apurva |
| author_facet | Mudgal, Apurva |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_01861 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A greedy maximal sweepline algorithm for a Jordan curve Mudgal, Apurva Computational Geometry 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. |
| title | A greedy maximal sweepline algorithm for a Jordan curve |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2605.01861 |