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.
| Original language | English |
|---|---|
| Title of host publication | 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) |
| Number of pages | 22 |
| Publisher | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH |
| Publication date | 12 Jun 2020 |
| Pages | 1-22 |
| DOIs | |
| Publication status | Published - 12 Jun 2020 |
| Externally published | Yes |
| Event | Scandinavian Symposium and Workshops on Algorithm Theory - Torshavn, Faroe Islands Duration: 22 Jun 2020 → 24 Jun 2020 Conference number: 17 https://swat-symposium.org/ |
Symposium
| Symposium | Scandinavian Symposium and Workshops on Algorithm Theory |
|---|---|
| Number | 17 |
| Country/Territory | Faroe Islands |
| City | Torshavn |
| Period | 22/06/2020 → 24/06/2020 |
| Internet address |
| Series | Leibniz International Proceedings in Informatics (LIPIcs) |
|---|---|
| ISSN | 1868-8969 |
Keywords
- Trajectories
- Visibility
- Data structures
- Semi-algebraic range searching
Fingerprint
Dive into the research topics of 'Trajectory Visibility'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver