Some lower bounds on geometric separability problems

被引：14
|
作者：
Arkin, EM [1 ]
Hurtado, F
Mitchell, JSB
Seara, C
Skiena, SS
机构：
[1] SUNY Stony Brook, Stony Brook, NY 11794 USA
[2] Politecn Catalunya, Dpt Matemat Aplicada 2, Barcelona 08034, Spain
来源：
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 2006年 / 16卷 / 01期
基金：
美国国家科学基金会; 美国国家航空航天局;
关键词：
lower bounds; separation; maximum gap;
D O I：
10.1142/S0218195906001902
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show Omega(n log n) time lower bounds for separability by means of strips, wedges, wedges with apices on a given line, fixed-slopes double wedges, and triangles, which match the complexity of the existing algorithms, and therefore prove their optimality.
引用
收藏
页码：1 / 26
页数：26
相关论文
共 50 条
12345