Given a packing of open balls and two points outside the balls at distance d from one another, nd the shortest path connecting the two points and avoiding the balls. We give an upper bound for the length of the shortest path showing that the he detour we have to make in order to cover a given distance d from one point to another one avoiding the members of a packing of balls with bounded radii in En approaches zero with the dimension. We also mention some open problems.