The angular blowing-a-kiss problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

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
Title of host publicationEuroCG 2020
Subtitle of host publicationBook of Abstracts, 36th European Workshop on Computational Geometry
Pages74:1-74:7
Number of pages7
Publication statusPublished - 16 Mar 2020
Event36th European Workshop on Computational Geometry - Online, Würzburg, Germany
Duration: 16 Mar 202018 Mar 2020
Conference number: 36
https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/

Conference

Conference36th European Workshop on Computational Geometry
Abbreviated titleEuroCG'20
CountryGermany
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