Home /Research /Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range
OTHER

Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range

Attila Hideg, Tamás Lukovszki, Bertalan Forstner

Year
2019
Citations
11

Keywords

RobotComputer scienceVisibilityRange (aeronautics)Visibility graphGraphCombinatoricsDiscrete mathematicsAlgorithmTheoretical computer science

Related papers

Browse all OTHER papers