Locating an axis-parallel rectangle on a Manhattan plane

被引:3
|
作者
Brimberg, Jack [1 ,2 ]
Juel, Henrik [3 ]
Koerner, Mark-Christoph [4 ]
Schoebel, Anita [4 ]
机构
[1] Royal Mil Coll Canada, Kingston, ON, Canada
[2] Grp Etudes & Rech Analyse Decis, Kingston, ON, Canada
[3] Tech Univ Denmark, DK-2800 Lyngby, Denmark
[4] Univ Gottingen, D-37073 Gottingen, Germany
关键词
Weber problem; Minisum; Dimensional facility; Polyhedral norms; MEDIAN HYPERPLANES; FACILITY LOCATION; DISTANCES; CLOSEST; CIRCLE; LINE; POINTS; SPACES; MODELS;
D O I
10.1007/s11750-012-0248-6
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we consider the problem of locating an axis-parallel rectangle in the plane such that the sum of distances between the rectangle and a finite point set is minimized, where the distance is measured by the Manhattan norm a"" (1). In this way we solve an extension of the Weber problem to extensive facility location. As a model, our problem is appropriate for position sensing of rectangular objects.
引用
收藏
页码:185 / 207
页数:23
相关论文
共 50 条
  • [41] Outlier Detection in Axis-Parallel Subspaces of High Dimensional Data
    Kriegel, Hans-Peter
    Kroeger, Peer
    Schubert, Erich
    Zimek, Arthur
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2009, 5476 : 831 - 838
  • [42] Small-size ε-Nets for Axis-Parallel Rectangles and Boxes
    Aronov, Boris
    Ezra, Esther
    Sharir, Micha
    STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 639 - 648
  • [43] Memory Optimisation for Hardware Induction of Axis-parallel Decision Tree
    Cheng, Chuan
    Bouganis, Christos-Savvas
    2014 INTERNATIONAL CONFERENCE ON RECONFIGURABLE COMPUTING AND FPGAS (RECONFIG), 2014,
  • [44] Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
    Gnewuch, Michael
    JOURNAL OF COMPLEXITY, 2008, 24 (02) : 154 - 172
  • [45] Approximation algorithms for minimizing empirical error by axis-parallel hyperplanes
    Elomaa, T
    Kujala, J
    Rousu, J
    MACHINE LEARNING: ECML 2005, PROCEEDINGS, 2005, 3720 : 547 - 555
  • [46] Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles
    Adrian Dumitrescu
    Joseph S. B. Mitchell
    Micha Sharir
    Discrete & Computational Geometry, 2004, 31 : 207 - 227
  • [47] On the Largest Empty Axis-Parallel Box Amidst n Points
    Adrian Dumitrescu
    Minghui Jiang
    Algorithmica, 2013, 66 : 225 - 248
  • [48] Characterizing families of cuts that can be represented by axis-parallel rectangles
    Brandes, U
    Cornelsen, S
    Wagner, D
    GRAPH DRAWING, 2004, 2912 : 357 - 368
  • [49] Approximability and hardness of geometric hitting set with axis-parallel rectangles
    Madireddy, Raghunath Reddy
    Mudgal, Apurva
    INFORMATION PROCESSING LETTERS, 2019, 141 : 9 - 15
  • [50] Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
    Dumitrescu, A
    Mitchell, JSB
    Sharir, M
    DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 31 (02) : 207 - 227