Covering a set of points with a minimum number of turns

Authors:
Michael J. Collins
Affiliations:
University of New Mexico and Sandia National Laboratories, Albuquerque, NM
Venue:
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Year:
2003

Citing 2
Cited 1

Improved lower bounds for the link length of rectilinear spanning paths in grids

Information Processing Letters
Optimal covering tours with turn costs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Improved FPT algorithms for rectilinear k-links spanning path

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

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.