Abstract
It is an old problem of Danzer and Rogers to decide whether it is possible to arrange O(1ε) points in the unit square so that every rectangle of area ε>0 within the unit square contains at least one of them. We show that the answer to this question is in the negative if we slightly relax the notion of rectangles, as follows.Let δ be a fixed small positive number. A quasi-rectangle is a region swept out by a continuously moving segment s, with no rotation, so that throughout the motion the angle between the trajectory of the center of s and its normal vector remains at most δ. We show that the smallest number of points needed to pierce all quasi-rectangles of area ε>0 within the unit square is Θ(1εlog1ε).
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 callDisclaimer: 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.
