Guarding scenes against invasive hypercubes. (Q1405005)

In recent years realistic input models for geometric algorithms have been studied. The most important models are fathness, low density, undutteredness and small simple-cover complexity. The authors show that guardable scenes fit in between undutteredness and small simple-cover complexity. Properties of guardable scenes and heuristic algorithms to compute small guarding sets are given.