Showing cs.CGShow all
2 papers · 1 filter
cs.CG2021
Efficient covering of convex domains by congruent discs
Shai Gul, Reuven Cohen, Simi Haber
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs ne…
cs.CG2018
Online exploration outside a convex obstacle
Shai Gul, Eitan Tiktinsky, Slava Shamshanov +1
A watchman path is a path such that a direct line of sight exists between each point in some region and some point along the path. Here, we study the online watchman path problem o…