Gathering by Repulsion

09/26/2018
by   Prosenjit Bose, et al.
0

We consider a repulsion actuator located in an n-sided convex environment full of point particles. When the actuator is activated, all the particles move away from the actuator. We study the problem of gathering all the particles to a point. We give an O(n^2) time algorithm to compute all the actuator locations that gather the particles to one point with one activation, and an O(n) time algorithm to find a single such actuator location if one exists. We then provide an O(n) time algorithm to place the optimal number of actuators whose sequential activation results in the gathering of the particles when such a placement exists.

READ FULL TEXT
research
03/30/2023

A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs

The weighted k-center problem in graphs is a classical facility location...
research
05/02/2023

Folding Every Point on a Polygon Boundary to a Point

We consider a problem in computational origami. Given a piece of paper a...
research
04/07/2022

Fast inverse elastic scattering of multiple particles in three dimensions

Many applications require recovering the geometry information of multipl...
research
07/01/2023

Maximum Overlap Area of Several Convex Polygons Under Translations

Let k ≥ 2 be a constant. Given any k convex polygons in the plane with a...
research
05/04/2023

Stereological determination of particle size distributions for similar convex bodies

Consider an opaque medium which contains 3D particles. All particles are...
research
06/26/2020

Point Proposal Network for Reconstructing 3D Particle Positions with Sub-Pixel Precision in Liquid Argon Time Projection Chambers

Liquid Argon Time Projection Chambers (LArTPC) are particle imaging dete...
research
04/22/2019

Computational Complexity of Biased Diffusion Limited Aggregation

Diffusion-Limited Aggregation (DLA) is a cluster growth model that consi...

Please sign up or login with your details

Forgot password? Click here to reset