The angular blowing-a-kiss problem

  • Kevin A. Buchin
  • , Irina Kostitsyna
  • , Roel Lambers
  • , Martijn A.C. Struijs

Research output: Contribution to conferencePaperAcademic

3 Downloads (Pure)

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.
Original languageEnglish
Pages74:1-74:7
Number of pages7
Publication statusPublished - 16 Mar 2020
Event36th European Workshop on Computational Geometry (EuroCG 2020) - Online, Würzburg, Germany
Duration: 16 Mar 202018 Mar 2020
Conference number: 36
https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/

Workshop

Workshop36th European Workshop on Computational Geometry (EuroCG 2020)
Abbreviated titleEuroCG'20
Country/TerritoryGermany
CityWürzburg
Period16/03/2018/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