Abstract
In this paper, we address the problem of computing a minimum-width square annulus in arbitrary orientation that encloses a given set of n points in the plane. A square annulus is the region between two concentric squares. We present an O(n3 log n)-time algorithm that finds such a square annulus over all orientations.
Cite
CITATION STYLE
APA
Bae, S. W. (2016). Computing a minimum-width square annulus in arbitrary orientation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9627, pp. 131–142). Springer Verlag. https://doi.org/10.1007/978-3-319-30139-6_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free