DeepAI AI Chat
Log In Sign Up

Gathering by Repulsion

by   Prosenjit Bose, et al.
Simon Fraser University

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.


Fast inverse elastic scattering of multiple particles in three dimensions

Many applications require recovering the geometry information of multipl...

Distributed leader election and computation of local identifiers for programmable matter

The context of this paper is programmable matter, which consists of a se...

Convex Hull Formation for Programmable Matter

We envision programmable matter as a system of nano-scale agents (called...

Efficient and Accurate Adaptive Resolution for Weakly-Compressible SPH

In this paper we propose an accurate, and computationally efficient meth...

Computational Complexity of Biased Diffusion Limited Aggregation

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

Pileup Mitigation with Machine Learning (PUMML)

Pileup involves the contamination of the energy distribution arising fro...