Covering a Set of Points with a Minimum Number of Turns

Abstract

Given a finite set of points in Euclidean space, we can ask what is the minimum number of times a piecewise-linear path must change direction in order to pass through all of them. We prove some new upper and lower bounds for a restricted version of this problem in which all motion is orthogonal to the coordinate axes.KeywordsOptimal PathLink LengthVertical LinkHorizontal LinkNational Nuclear SecurityThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.