Showing cs.CGShow all
3 papers · 1 filter
cs.CG2022
An Efficient Algorithm for the Proximity Connected Two Center Problem
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
Given a set of points in the plane, the -center problem is to find congruent disks of minimum possible radius such that their union covers all the points in . The…
cs.CG2018
Gathering by Repulsion
Prosenjit Bose, Thomas Shermer
We consider a repulsion actuator located in an -sided convex environment full of point particles. When the actuator is activated, all the particles move away from the actuator.…
cs.CG2015
A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons
Thomas C. Shermer
Beacon attraction is a movement system whereby a robot (modeled as a point in 2D) moves in a free space so as to always locally minimize its Euclidean distance to an activated beac…