Login / Signup
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.
Eyal Ackerman
Balázs Keszegh
Günter Rote
Published in:
Discret. Comput. Geom. (2022)
Keyphrases
</>
upper bound
small number
genetic algorithm
lower bound
data sets
computational complexity
search algorithm
constant factor
dynamic programming
evolutionary algorithm
feature space
case study
feature selection
information systems
information retrieval
data mining
databases