IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v68y2017i1d10.1007_s10898-016-0452-2.html
   My bibliography  Save this article

Algorithms for art gallery illumination

Author

Listed:
  • Maximilian Ernestus

    (TU Braunschweig, IBR, Algorithms Group)

  • Stephan Friedrichs

    (Max Planck Institute for Informatics
    Saarbrücken Graduate School of Computer Science)

  • Michael Hemmer

    (TU Braunschweig, IBR, Algorithms Group)

  • Jan Kokemüller

    (TU Braunschweig, IBR, Algorithms Group)

  • Alexander Kröller

    (TU Braunschweig, IBR, Algorithms Group)

  • Mahdi Moeini

    (Technical University of Kaiserslautern)

  • Christiane Schmidt

    (Linköping University)

Abstract

The art gallery problem (AGP) is one of the classical problems in computational geometry. It asks for the minimum number of guards required to achieve visibility coverage of a given polygon. The AGP is well-known to be NP-hard even in restricted cases. In this paper, we consider the AGP with fading (AGPF): A polygonal region is to be illuminated with light sources such that every point is illuminated with at least a global threshold, light intensity decreases over distance, and we seek to minimize the total energy consumption. Choosing fading exponents of zero, one, and two are equivalent to the AGP, laser scanner applications, and natural light, respectively. We present complexity results as well as a negative solvability result. Still, we propose two practical algorithms for AGPF with fixed light positions (e.g. vertex guards) independent of the fading exponent, which we demonstrate to work well in practice. One is based on a discrete approximation, the other on non-linear programming by means of simplex-partitioning strategies. The former approach yields a fully polynomial-time approximation scheme for the AGPF with fixed light positions. The latter approach obtains better results in our experimental evaluation.

Suggested Citation

  • Maximilian Ernestus & Stephan Friedrichs & Michael Hemmer & Jan Kokemüller & Alexander Kröller & Mahdi Moeini & Christiane Schmidt, 2017. "Algorithms for art gallery illumination," Journal of Global Optimization, Springer, vol. 68(1), pages 23-45, May.
    • Handle: RePEc:spr:jglopt:v:68:y:2017:i:1:d:10.1007_s10898-016-0452-2
    DOI: 10.1007/s10898-016-0452-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0452-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-016-0452-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:68:y:2017:i:1:d:10.1007_s10898-016-0452-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.