Covering Paths and Trees for Planar Grids

Keszegh, Balázs (2014) Covering Paths and Trees for Planar Grids. Geombinatorics Quarterly, 24 (1). pp. 1-5.

Preview

Text coveringpathgrid01.pdf Download (78kB) | Preview

Abstract

Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n × m grid. We show that the minimal number of segments of such a path is 2 min(n;m) − 1 except when we allow crossings and n = m ≥ 3, in which case the minimal number of segments of such a path is 2 min(n;m) − 2, i.e., in this case we can save one segment. In fact we show that these are true even if we consider covering trees instead of paths. These results extend previous works on axis-aligned covering paths of n × m grids and complement the recent study of covering paths for points in general position, in which case the problem becomes significantly harder and is still open.

Actions (login required)

Edit Item