An optimal algorithm for geodesic mutual visibility on hexagonal grids

Sahar Badri, Serafino Cicerone, Alessia Di Fonso +1

For a set of robots (or agents) moving in a graph, two properties are highly desirable: confidentiality (i.e., a message between two agents must not pass through any intermediate a…