Hiding points in arrangements of segments

被引：1
|
作者：
Hurtado, F
Serra, O
Urrutia, J
机构：
[1] UNIV POLITECN CATALUNYA,DEPT MATEMAT APLICADA 2,BARCELONA 08028,SPAIN
[2] UNIV OTTAWA,OTTAWA,ON K1N 6N5,CANADA
来源：
DISCRETE MATHEMATICS | 1996年 / 162卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(95)00285-5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A hidden set is a set of points such that no two points in the set are visible to each other. In this paper we study hidden sets of points in arrangements of segments, and we provide bounds for its maximum size that are optimal up to a factor 2.
引用
收藏
页码：187 / 197
页数：11
相关论文
共 50 条
  • [31] Configurations of points and topology of real line arrangements
    Guerville-Balle, Benoit
    Viu-Sos, Juan
    MATHEMATISCHE ANNALEN, 2019, 374 (1-2) : 1 - 35
  • [32] Double Points of Free Projective Line Arrangements
    Abe, Takuro
    INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2022, 2022 (03) : 1811 - 1824
  • [33] Line arrangements with the maximal number of triple points
    M. Dumnicki
    Ł. Farnik
    A. Główka
    M. Lampa-Baczyńska
    G. Malara
    T. Szemberg
    J. Szpond
    H. Tutaj-Gasińska
    Geometriae Dedicata, 2016, 180 : 69 - 83
  • [34] Line arrangements with the maximal number of triple points
    Dumnicki, M.
    Farnik, L.
    Glowka, A.
    Lampa-Baczynska, M.
    Malara, Grzegorz
    Szemberg, T.
    Szpond, J.
    Tutaj-Gasinska, H.
    GEOMETRIAE DEDICATA, 2016, 180 (01) : 69 - 83
  • [35] Depth of segments and circles through points enclosing many points: a note
    Ramos, Pedro A.
    Viana, Raquel
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2009, 42 (04): : 338 - 341
  • [36] Stripped halfedge data structure for parallel computation of arrangements of segments
    Damiand, Guillaume
    Coeurjolly, David
    Bourquat, Pierre
    VISUAL COMPUTER, 2021, 37 (9-11): : 2461 - 2472
  • [37] Stripped halfedge data structure for parallel computation of arrangements of segments
    Guillaume Damiand
    David Coeurjolly
    Pierre Bourquat
    The Visual Computer, 2021, 37 : 2461 - 2472
  • [38] Reversible Data Hiding using Reference Points Coding
    Tan, Yi-Fei
    Guo, Xiaoning
    Tan, Wooi-Nee
    PROCEEDINGS OF 2017 IEEE 2ND INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC), 2017, : 55 - 59
  • [39] Efficient Binary Data Hiding Technique in Boundary Points
    Kumar, Subodh
    Mal, Sandip
    2016 SECOND INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE & COMMUNICATION TECHNOLOGY (CICT), 2016, : 43 - 47
  • [40] Proximity problems on line segments spanned by points
    Daescu, O
    Luo, J
    Mount, DM
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2006, 33 (03): : 115 - 129
12345