The angular blowing-a-kiss problem

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademic

Samenvatting

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.
Originele taal-2Engels
TitelEuroCG 2020
SubtitelBook of Abstracts, 36th European Workshop on Computational Geometry
Pagina's74:1-74:7
Aantal pagina's7
StatusGepubliceerd - 16 mrt 2020
Evenement36th European Workshop on Computational Geometry -
Duur: 16 mrt 201718 mrt 2020
Congresnummer: 36

Workshop

Workshop36th European Workshop on Computational Geometry
Verkorte titelEuroCG 2020
Periode16/03/1718/03/20

Vingerafdruk Duik in de onderzoeksthema's van 'The angular blowing-a-kiss problem'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit