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.
Cite
CITATION STYLE
Bae, S. W. (2016). Computing a minimum-width square or rectangular annulus with outliers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9797, pp. 443–454). Springer Verlag. https://doi.org/10.1007/978-3-319-42634-1_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
