Trajectory Visibility
- Patrick Eades,
- ,
- Maarten Löffler,
- Frank Staals
- The University of Sydney,
- Utrecht University
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-review
Open access
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 1-22 (22 pages)Publication milestones
- Published - 12/06/2020
Publication status
Published - 12/06/2020
Publisher
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbHBook series
- Book series name: Leibniz International Proceedings in Informatics (LIPIcs)
ISSN: 1868-8969
Publication IDs
- Scopus: 85090389618
Host publication title
17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)Abstract
We study the problem of testing whether there exists a time at which two entities moving along different piece-wise linear trajectories among polygonal obstacles are mutually visible. We study several variants, depending on whether or not the obstacles form a simple polygon, trajectories may intersect the polygon edges, and both or only one of the entities are moving.
Publication metrics
PlumX, opens in new tab
Captures
3
Citations
4
Access to documents
Related Event
Title
Scandinavian Symposium and Workshops on Algorithm Theory
Event type
SymposiumDate
22/06/2020 - 24/06/2020Location
TorshavnFaroe Islands