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 条
  • [1] Lower bounds for geometric diameter problems
    Fournier, H
    Vigneron, A
    [J]. LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 467 - 478
  • [2] Fractal Dimension and Lower Bounds for Geometric Problems
    Anastasios Sidiropoulos
    Kritika Singhal
    Vijay Sridhar
    [J]. Discrete & Computational Geometry, 2021, 66 : 32 - 67
  • [3] Fractal Dimension and Lower Bounds for Geometric Problems
    Sidiropoulos, Anastasios
    Singhal, Kritika
    Sridhar, Vijay
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2021, 66 (01) : 32 - 67
  • [4] Lower bounds on some geometric quantities and applications
    Leung, MC
    [J]. GEOMETRY FROM THE PACIFIC RIM, 1997, : 207 - 218
  • [5] Lower bounds on concurrence and separability conditions
    de Vicente, Julio I.
    [J]. PHYSICAL REVIEW A, 2007, 75 (05):
  • [6] A family of separability criteria and lower bounds of concurrence
    Xian Shi
    Yashuai Sun
    [J]. Quantum Information Processing, 22
  • [7] A family of separability criteria and lower bounds of concurrence
    Shi, Xian
    Sun, Yashuai
    [J]. QUANTUM INFORMATION PROCESSING, 2023, 22 (03)
  • [8] Lower bounds for some decision problems over C
    Malajovich, G
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) : 425 - 434
  • [9] Lower Bounds on the Infima in Some H∞ Optimization Problems
    Wahls, Sander
    Boche, Holger
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2012, 57 (03) : 788 - 793
  • [10] Lower bounds for query complexity of some graph problems
    Lace, L
    Freivalds, R
    [J]. VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI, 2003, : 309 - 313
12345