On the Inverse Beacon Attraction Region of a Point.
Bahram Kouhestani, David D. Rappaport, Kai Salomaa · Canadian Conference on Computational Geometry · 2015
Motivated by routing in sensor networks, Biro et al. [2] introduced the notion of beacon attraction and inverse attraction as a new variant of visibility in a simple polygon. A beacon b is a point inside a polygon P that can induce an attraction that moves a target pointp greedily towards it in a trajectory that always reduces distance from p to b. The trajectory of p may require sliding p along the boundary of an obstacle. The attraction region of b is the set of all points that eventually reach b. The inverse attraction region ofp is the set of points that can attract p. We present algorithms to eciently compute the inverse attraction region of a point for simple, monotone, and terrain polygons with respective time