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.- Sort by
- Weight
- Alphabetically
An almost optimal bound on the number of intersections of two simple polygons
Eyal Ackerman, Balázs Keszegh, Günter Rote
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review