A bound for Delaunay flip algorithms on flat tori (Best Student Paper Award).

Published in: CCCG (2022)

Keyphrases

learning algorithm
orders of magnitude
times faster
worst case
error bounds
computational cost
computationally efficient
selected papers
neural network
data dependent
optimization problems
upper bound
significant improvement
lower bound
computational complexity
learning environment
data structure