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

Eyal Ackerman Balázs Keszegh Günter Rote

Published in: SoCG (2020)

Keyphrases

small number
worst case
constant factor
real time
computational complexity
estimation error
neural network
real world
decision trees
upper bound
approximation algorithms
minimum length
determine the optimal number