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

Eyal Ackerman, Balázs Keszegh, Günter Rote (2020)
[–] 

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2020.1

access: open

type: Conference or Workshop Paper

metadata version: 2021-06-16

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.