Abstract
The problem of finding short paths avoiding obstacles in a packing was extensively studied. Similar question concerning coverings received less attention. Here we consider locally finite coverings of the plane (i) by discs of radius 1, (ii) by squares of area 1. Given two discs (squares resp.) centered at x and x' one can ask for the least number of discs (squares) needed to connect the given discs (squares resp.). Estimates of type (C + o(1)) d(x,x') as the Euclidean distance d(x,x') rightarrow infty will be given. For discs we prove C= frac{2}{sqrt{3}} thickapprox 1.15 dots , for squares we prove C = 2sqrt{2}. The latter constant turns out to be the best possible.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Beitr\xe4ge zur Algebra und Geometrie / Contributions to Algebra and Geometry
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
