Minimum-Link Rectilinear Covering Tour is NP-hard in $R^4$

Bhadrachalam Chitturi, Jayakumar Pai

Given a set $P$ of $n$ points in $R^d$, a tour is a closed simple path that covers all the given points, i.e. a Hamiltonian cycle. % In $P$ if no three points are collinear then…