An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons

Eyal Ackerman, Balázs Keszegh, Günter Rote

Research output: Contribution to journalArticlepeer-review

Fingerprint

Dive into the research topics of 'An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons'. Together they form a unique fingerprint.

Keyphrases

Mathematics