ON THE RECTILINEAR ART GALLERY PROBLEM - ALGORITHMIC ASPECTS

被引：0
|
作者：
HOFFMANN, F [1 ]
KAUFMANN, M [1 ]
机构：
[1] UNIV SAARLAND, FACHBEREICH INFORMAT 14, W-6600 SAARBRUCKEN, GERMANY
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 484卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We investigate the watchman problem for rectilinear art galleries with an arbitrary number of holes. An efficient algorithm for the placement of the guards with running time O(n3/2 log2 n log log n) is presented. Each guard has to watch an r-star of constant size.
引用
收藏
页码：239 / 250
页数：12
相关论文
共 50 条
  • [21] A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
    Hengeveld, Simon B.
    Miltzow, Tillmann
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2023, 25 (02):
  • [22] QUEENSLAND ART GALLERY | GALLERY OF MODERN ART
    Butler, Rex
    ARTFORUM INTERNATIONAL, 2015, 54 (04): : 280 - 280
  • [23] NN-Steiner: A Mixed Neural-Algorithmic Approach for the Rectilinear Steiner Minimum Tree Problem
    Kahng, Andrew B.
    Nerem, Robert R.
    Wang, Yusu
    Yang, Chien-Yi
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 12, 2024, : 13022 - 13030
  • [24] Experimental evaluation of an exact algorithm for the orthogonal art gallery problem
    Couto, Marcelo C.
    de Souza, Cid C.
    de Rezende, Pedro J.
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2008, 5038 : 101 - 113
  • [25] Art gallery problem with guards whose range of vision is 180°
    Tóth, CD
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2000, 17 (3-4): : 121 - 134
  • [26] Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons
    Iwamoto, Chuzo
    Ibusuki, Tatsuaki
    WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2020), 2020, 12049 : 146 - 157
  • [27] NP-completeness of chromatic orthogonal art gallery problem
    Hoorfar, Hamid
    Bagheri, Alireza
    JOURNAL OF SUPERCOMPUTING, 2021, 77 (03): : 3077 - 3109
  • [28] NP-completeness of chromatic orthogonal art gallery problem
    Hamid Hoorfar
    Alireza Bagheri
    The Journal of Supercomputing, 2021, 77 : 3077 - 3109
  • [29] RECTILINEAR STEINER PROBLEM
    HWANG, FK
    JOURNAL OF DESIGN AUTOMATION & FAULT-TOLERANT COMPUTING, 1978, 2 (04): : 303 - 310
  • [30] ART & GALLERY
    China's Foreign Trade, 2009, (08) : 2 - 3
12345