Abstract
In this paper, we report on the theory and implementation of an O(n 3) algorithm for computing the largest empty rectangle of arbitrary orientation for a given set of n points in the plane. © Springer-Verlag 2003.
Cite
CITATION STYLE
APA
Mukhopadhyay, A., & Rao, S. V. (2003). Computing a largest empty arbitrary oriented rectangle: Theory and implementation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2669, 797–806. https://doi.org/10.1007/3-540-44842-x_81
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