International Journal of Computational Geometry & Applications · 2011 · 35 citations · 9 references
ComputingFine ArtsComputational GeometryDescriptive GeometryMachine VisionCamera MovementVisibility ComputationCamerasPolynomial Time ComplexityPolynomial-time AlgorithmsPolynomial-time Reductions
We study the problem of guarding an orthogonal art gallery with security cameras sliding back and forth along straight tracks. We show that if only vertical (alternatively, horizontal) tracks are allowed, then a solution minimizing the number of tracks can be found in polynomial time, and if both orientations are allowed, then a 2-approximation can be found in polynomial time for x-monotone galleries.
9
The strong perfect graph theorem
Maria Chudnovsky, Neil Robertson, Paul Seymour et al. · Annals of Mathematics · 2006 · 1.3K citations · Full text
Mark de Berg · Computational Geometry · 1991 · 49 citations · Full text