Covering point sets with two disjoint disks or squares

Open archive-Elsevier

Detalles Bibliográficos
Autores: Cabello, Sergio, Díaz Báñez, José Miguel, Seara Ojea, Carlos, Sellarés, J. Antoni, Urrutia, Jorge, Ventura Molina, Inmaculada
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2007
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/77941
Acceso en línea:https://hdl.handle.net/11441/77941
https://doi.org/10.1016/j.comgeo.2007.10.001
Access Level:acceso abierto
Palabra clave:Covering
Facility location
Geometric optimization
id ES_2f258d0b422fa92a3df7dd8db3f3f5be
oai_identifier_str oai:idus.us.es:11441/77941
network_acronym_str ES
network_name_str España
repository_id_str
spelling Covering point sets with two disjoint disks or squaresCabello, SergioDíaz Báñez, José MiguelSeara Ojea, CarlosSellarés, J. AntoniUrrutia, JorgeVentura Molina, InmaculadaCoveringFacility locationGeometric optimizationOpen archive-ElsevierWe study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red points covered by CR plus the number of blue points covered by CB is maximized. We give an algorithm to solve this problem in O(n8/3 log2 n) time, where n denotes the total number of points. We also show that the analogous problem of finding two axis-aligned unit squares SR and SB instead of unit disks can be solved in O(nlog n) time, which is optimal. If we do not restrict ourselves to axis-aligned squares, but require that both squares have a common orientation, we give a solution using O(n3 log n) time.ElsevierMatemática Aplicada II2007info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/77941https://doi.org/10.1016/j.comgeo.2007.10.001reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésComputational Geometry, 40 (3), 195-206.https://www.sciencedirect.com/science/article/pii/S0925772107001034info:eu-repo/semantics/openAccessoai:idus.us.es:11441/779412026-06-17T12:51:07Z
dc.title.none.fl_str_mv Covering point sets with two disjoint disks or squares
title Covering point sets with two disjoint disks or squares
spellingShingle Covering point sets with two disjoint disks or squares
Cabello, Sergio
Covering
Facility location
Geometric optimization
title_short Covering point sets with two disjoint disks or squares
title_full Covering point sets with two disjoint disks or squares
title_fullStr Covering point sets with two disjoint disks or squares
title_full_unstemmed Covering point sets with two disjoint disks or squares
title_sort Covering point sets with two disjoint disks or squares
dc.creator.none.fl_str_mv Cabello, Sergio
Díaz Báñez, José Miguel
Seara Ojea, Carlos
Sellarés, J. Antoni
Urrutia, Jorge
Ventura Molina, Inmaculada
author Cabello, Sergio
author_facet Cabello, Sergio
Díaz Báñez, José Miguel
Seara Ojea, Carlos
Sellarés, J. Antoni
Urrutia, Jorge
Ventura Molina, Inmaculada
author_role author
author2 Díaz Báñez, José Miguel
Seara Ojea, Carlos
Sellarés, J. Antoni
Urrutia, Jorge
Ventura Molina, Inmaculada
author2_role author
author
author
author
author
dc.contributor.none.fl_str_mv Matemática Aplicada II
dc.subject.none.fl_str_mv Covering
Facility location
Geometric optimization
topic Covering
Facility location
Geometric optimization
description Open archive-Elsevier
publishDate 2007
dc.date.none.fl_str_mv 2007
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/77941
https://doi.org/10.1016/j.comgeo.2007.10.001
url https://hdl.handle.net/11441/77941
https://doi.org/10.1016/j.comgeo.2007.10.001
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Computational Geometry, 40 (3), 195-206.
https://www.sciencedirect.com/science/article/pii/S0925772107001034
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405458492555264
score 15,300724

Similares en LA Referencia