Computing a minimum-width square annulus in arbitrary orientation

被引：11
|
作者：
Bae, Sang Won [1 ]
机构：
[1] Kyonggi Univ, Dept Comp Sci, Suwon, South Korea
来源：
THEORETICAL COMPUTER SCIENCE | 2018年 / 718卷
关键词：
Computational geometry; Covering problem; Square annulus; Arbitrary orientation; Exact algorithm; GEOMETRIC OPTIMIZATION; PLACEMENT PROBLEMS; OFFSET-POLYGON;
D O I：
10.1016/j.tcs.2016.11.010
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we address the problem of computing a minimum-width square annulus in arbitrary orientation that encloses a given set of n points in the plane. A square annulus is the region between two concentric squares. We present an O(n(3) log n)-time algorithm that finds such a square annulus over all orientations. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码：2 / 13
页数：12
相关论文
共 50 条
  • [21] An optimal algorithm for the minimum-width cubic shell problem
    Bae, Sang Won
    OPERATIONS RESEARCH LETTERS, 2023, 51 (05) : 477 - 482
  • [22] Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells
    P. K. Agarwal
    B. Aronov
    M. Sharir
    Discrete & Computational Geometry, 2001, 26 : 307 - 320
  • [23] Minimum-Width Confidence Bands via Constraint Optimization
    Berg, Jeremias
    Oikarinen, Emilia
    Jarvisalo, Matti
    Puolamaki, Kai
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING (CP 2017), 2017, 10416 : 443 - 459
  • [24] Exact and approximation algorithms for minimum-width cylindrical shells
    Agarwal, PK
    Aronov, B
    Sharir, M
    DISCRETE & COMPUTATIONAL GEOMETRY, 2001, 26 (03) : 307 - 320
  • [25] Approximation and exact algorithms for minimum-width annuli and shells
    Agarwal, Pankaj K.
    Aronov, Boris
    Har-Peled, Sariel
    Sharir, Micha
    Proceedings of the Annual Symposium on Computational Geometry, 1999, : 380 - 389
  • [26] A heuristic for minimum-width graph layering with consideration of dummy nodes
    Tarassov, A
    Nikolov, NS
    Branke, J
    EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 570 - 583
  • [27] A data-parallel algorithm for minimum-width tree layout
    Lang, W
    INFORMATION PROCESSING LETTERS, 1998, 67 (01) : 21 - 28
  • [28] Minimum Width Color Spanning Annulus
    Acharyya, Ankush
    Nandy, Subhas C.
    Roy, Sasanka
    COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 431 - 442
  • [29] MINIMUM-WIDTH METHOD OF VARIABLE ORDERING FOR BINARY DECISION DIAGRAMS
    MINATO, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1992, E75A (03) : 392 - 399
  • [30] Minimum width color spanning annulus
    Acharyya, Ankush
    Nandy, Subhas C.
    Roy, Sasanka
    THEORETICAL COMPUTER SCIENCE, 2018, 725 : 16 - 30
12345