Disjoint empty disks supported by a point set

被引：0
|
作者：
Dumitrescu A. [1 ]
Jiang M. [2 ]
机构：
[1] Department of Computer Science, University of Wisconsin-Milwaukee, 3200 N. Cramer Street, Milwaukee, WI
[2] Department of Computer Science, Utah State University, 4205 Old Main Hill, Logan, UT
来源：
Journal of Geometry | 2013年 / 104卷 / 2期
关键词：
connected component; Empty disk; graph; point-circle incidence;
D O I：
10.1007/s00022-013-0160-8
中图分类号：
学科分类号：
摘要：
For a planar point-set P, let D(P) be the minimum number of pairwise-disjoint empty disks such that each point in P lies on the boundary of some disk. Further define D(n) as the maximum of D(P) over all n-element point sets. Hosono and Urabe recently conjectured that D(n) = ⌈ n/2 ⌉. Here we show that D(n) ≥q n/2 + n/236 - O(√{n}) and thereby disprove this conjecture. © 2013 Springer Basel.
引用
收藏
页码：277 / 295
页数：18
相关论文
共 50 条
  • [1] Covering a bichromatic point set with two disjoint monochromatic disks
    Cabello, S.
    Diaz-Banez, J. M.
    Perez-Lantero, P.
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2013, 46 (03): : 203 - 212
  • [2] A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
    Hosono, Kiyoshi
    Urabe, Masatsugu
    [J]. COMPUTATIONAL GEOMETRY AND GRAPH THEORY, 2008, 4535 : 90 - 100
  • [3] Disjoint empty convex pentagons in planar point sets
    Bhaswar B. Bhattacharya
    Sandip Das
    [J]. Periodica Mathematica Hungarica, 2013, 66 : 73 - 86
  • [4] Disjoint empty convex pentagons in planar point sets
    Bhattacharya, Bhaswar B.
    Das, Sandip
    [J]. PERIODICA MATHEMATICA HUNGARICA, 2013, 66 (01) : 73 - 86
  • [5] Covering point sets with two disjoint disks or squares
    Cabello, Sergio
    Diaz-Banez, J. Miguel
    Seara, Carlos
    Sellares, J. Antoni
    Urrutia, Jorge
    Ventura, Inmaculada
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 40 (03): : 195 - 206
  • [6] COVERING A POINT SET BY TWO DISJOINT RECTANGLES
    Kim, Sang-Sub
    Bae, Sang Won
    Ahn, Hee-Kap
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011, 21 (03) : 313 - 330
  • [7] Covering a Point Set by Two Disjoint Rectangles
    Ahn, Hee-Kap
    Bae, Sang Won
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 728 - +
  • [8] On empty convex polygons in a planar point set
    Pinchasi, R
    Radoicic, R
    Sharir, M
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (03) : 385 - 419
  • [9] Largest empty rectangle among a point set
    Chaudhuri, J
    Nandy, SC
    Das, S
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2003, 46 (01): : 54 - 78
  • [10] On the number of disjoint convex quadrilaterals for a planar point set
    Hosono, K
    Urabe, M
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 20 (03): : 97 - 104
12345