Abstract
Given a set of agents that have fixed locations but can rotate at unit speed, we aim to find an
efficient schedule such that every pair of agents has looked at each other. We present schedules
and lower bounds for different geometric settings.
efficient schedule such that every pair of agents has looked at each other. We present schedules
and lower bounds for different geometric settings.
| Original language | English |
|---|---|
| Pages | 74:1-74:7 |
| Number of pages | 7 |
| Publication status | Published - 16 Mar 2020 |
| Event | 36th European Workshop on Computational Geometry (EuroCG 2020) - Online, Würzburg, Germany Duration: 16 Mar 2020 → 18 Mar 2020 Conference number: 36 https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/ |
Workshop
| Workshop | 36th European Workshop on Computational Geometry (EuroCG 2020) |
|---|---|
| Abbreviated title | EuroCG'20 |
| Country/Territory | Germany |
| City | Würzburg |
| Period | 16/03/20 → 18/03/20 |
| Internet address |
Fingerprint
Dive into the research topics of 'The angular blowing-a-kiss problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver