Skip to main content
Conference Proceedings

Smallest color-spanning objects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2161 278-289
DOI: 10.1007/3-540-44676-1_23
57Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest– by perimeter or area–axis-parallel rectangle and the narrowest strip enclosing at least one site of each color.

Cite

CITATION STYLE

APA

Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., … Sacristán, V. (2001). Smallest color-spanning objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2161, pp. 278–289). Springer Verlag. https://doi.org/10.1007/3-540-44676-1_23

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