Traversing a set of points with a minimum number of turns

Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number of segments (links). We call this minimization problem the minimum link spanning path problem. This natural problem has appeared several times in the literature under different variants. The simplest one is that in which the allowed paths are axis-aligned. Let L(S) be the minimum number of links of an axis-aligned path for S and let Gd n be a n

• Type: Conference
• Year: 2007
• Where: COMPGEOM
• Authors: Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr
• Keywords: Axis-aligned Path, COMPGEOM 2007, Discrete Geometry, Minimum Number, Spanning Path