Beacon attraction, or simply attraction, is a movement system whereby a point moves in a free space so as to always locally minimize its Euclidean distance to an activated beacon (also a point). This results in the point moving directly towards the beacon when it can, and otherwise sliding along the edge of an obstacle or being stuck (unable to move). When the point can reach the activated beacon by this method, we say that the beacon attracts the point. In this paper, we study attractionconvex polygons, which are those where every point in the polygon attracts every other point. We find that these polygons are a subclass of weakly externally visible polygons, which are those where every point on the boundary is visible from some point arbitrarily distant (or at infinity on the projective plane). We propose a new class of polygons called normally visible, and show that this is exactly the class of attraction-convex polygons. This alternative characterization of attractionconvex polygons leads to a simple linear-time attractionconvex polygon recognition algorithm. We also give a Helly-type characterization of inverse-attraction starshaped polygons.

Additional Metadata
Conference 31st Canadian Conference on Computational Geometry, CCCG 2019
Citation
Bose, P, & Shermer, T.C. (Thomas C.). (2019). Attraction-convexity and normal visibility. In Proceedings of the 31st Canadian Conference on Computational Geometry, CCCG 2019 (pp. 110–116).