Skip to main content
Conference Proceedings

Rectilinear convex hull with minimum area

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7579 LNCS 226-235
DOI: 10.1007/978-3-642-34191-5_22
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let P be a set of n points in the plane. We solve the problem of computing an orientation of the plane for which the rectilinear convex hull of P has minimum area in optimal Θ(n log n) time and O(n) space. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Alegría-Galicia, C., Garduño, T., Rosas-Navarrete, A., Seara, C., & Urrutia, J. (2012). Rectilinear convex hull with minimum area. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7579 LNCS, pp. 226–235). https://doi.org/10.1007/978-3-642-34191-5_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free