Covering Paths for Planar Point Sets

Adrian Dumitrescu, Daniel Gerbner, Balazs Keszegh +1

Given $n$ points in the plane, a \emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least $n/2$…