Gathering by repulsion

DOI10.4230/LIPICS.SWAT.2018.13zbMATH Open1476.68276OpenAlexW2807211522MaRDI QIDQ5116477FDOQ5116477

Authors: Prosenjit Bose, Thomas C. Shermer 

Publication date: 25 August 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.SWAT.2018.13

Recommendations

• Gathering by repulsion
• Transmitting particles in a polygonal domain by repulsion
• scientific article; zbMATH DE number 2038783
• Collisionless gathering of robots with an extent
• A continuous strategy for collisionless gathering

zbMATH Keywords

kernelpolygonbeacon attraction

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Topologically sweeping an arrangement
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Self-approaching curves
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Corrigendum: Topologically sweeping an arrangement
• Routing in a polygonal terrain with the shortest beacon watchtower
• Beacon-based algorithms for geometric routing

Cited In (1)

• Gathering by repulsion

This page was built for publication: Gathering by repulsion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116477)