Traversing a Set of Points with a Minimum Number of Turns

Abstract

Given a finite set of points S in Euclidean space, we consider visiting the points in S with a polygonal path which makes a minimum number of turns.

Keywords

• Traversing
• Points
• Minimum
• Number
• Turns