Abstract
A square or rectangular annulus is the closed region between a square or rectangle and its offset. In this paper, we address the problem of computing a minimum-width square or rectangular annulus that contains at least \(n-k\) points out of n given points in the plane. The k excluded points are considered as outliers of the n input points. We present several first algorithms to the problem.
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.
