Some problems related to good illumination Conference

Abellanas, M, Bajuelos, A, Matos, I. (2007). Some problems related to good illumination . EURO-PAR 2011 PARALLEL PROCESSING, PT 1, 4705 LNCS(PART 1), 1-14. 10.1007/978-3-540-74472-6_1

cited authors

  • Abellanas, M; Bajuelos, A; Matos, I

authors

abstract

  • A point p is 1-well illuminated by a set of n point lights if there is, at least, one light interior to each half-plane with p on its border. We consider the illumination range of the lights as a parameter to be optimized. So we minimize the lights' illumination range to 1-well illuminate a given point p. We also present two generalizations of 1-good illumination: the orthogonal good illumination and the good ⊖-illumination. For the first, we propose an optimal linear time algorithm to optimize the lights' illumination range to orthogonally well illuminate a point. We present the E-Voronoi Diagram for this variant and an algorithm to compute it that runs in σ(n4) time. For the second and given a fixed angle ⊖ ≤ π, we present a linear time algorithm to minimize the lights' illumination range to well ⊖-illuminate a point. © Springer-Verlag Berlin HeidelBerg 2007.

publication date

  • January 1, 2007

published in

Digital Object Identifier (DOI)

International Standard Book Number (ISBN) 13

start page

  • 1

end page

  • 14

volume

  • 4705 LNCS

issue

  • PART 1