ALL libraries (COBIB.SI union bibliographic/catalogue database)
13.
Covering point sets with two disjoint disks or squares [Elektronski vir]
Cabello, Sergio ...
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks ▫$C_R$▫ and ▫$C_B$▫ with disjoint interiors such that the number of red points ...covered by ▫$C_R$▫ plus the number of blue points covered by ▫$C_B$▫ is maximized. We give an algorithm to solve this problem in ▫$O(n^{8/3}\log^2 n)$▫ time, where ▫$n$▫ denotes the total number of points. We also show that the analogous problem of finding two axis-aligned unit squares ▫$S_R$▫ and ▫$S_B$▫ instead of unit disks can be solved in ▫$O(n\log 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(n^3\log n)$▫ time.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
