Square and Rectangle Covering with Outliers

被引：0
|
作者：
Ahn, Hee-Kap [1 ]
Bae, Sang Won [1 ]
Kim, Sang-Sub [1 ]
Korman, Matias [2 ]
Reinbacher, Iris [1 ]
Son, Wanbin [1 ]
机构：
[1] POSTECH, Dept Comp Sci & Engn, Pohang, South Korea
[2] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 980, Japan
来源：
FRONTIERS IN ALGORITHMICS, PROCEEDINGS | 2009年 / 5598卷
关键词：
K-POINTS;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
For a set of n points in the plane, we consider the axis-aligned (p; k)-Box COVERING problem: Find p axis-aligned, pairwise disjoint. boxes that together contain exactly n-k points. Here, our boxes are either squares or rectangles, and we want to minimize the area of the largest box. For squares, we present algorithms that find the solution in O(n + k log k) time for p = 1. and in O(n log n + k(p) log(p) k) time for p = 2; 3. For rectangles we have running times of O(n + k(3)) for p = 1 and O(n log n + k(2+p) log(p-1) k) time for p = 2; 3. In all cases; our algorithms use O(n) space.
引用
收藏
页码：132 / +
页数：3
相关论文
共 50 条
12345