Trajectory Visibility

Patrick Eades; Ivor van der Hoog; Maarten Löffler; Frank Staals

doi:10.4230/LIPIcs.SWAT.2020.23

Trajectory Visibility

Patrick Eades
, Ivor van der Hoog
, Maarten Löffler
, Frank Staals

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

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.

Originalsprog	Engelsk
Titel	17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Antal sider	22
Forlag	Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH
Publikationsdato	12 jun. 2020
Sider	1-22
DOI	https://doi.org/10.4230/LIPIcs.SWAT.2020.23
Status	Udgivet - 12 jun. 2020
Udgivet eksternt	Ja
Begivenhed	Symposium and Workshops on Algorithm Theory - Torshavn, Færøerne Varighed: 22 jun. 2020 → 24 jun. 2020 Konferencens nummer: 17 https://swat-symposium.org/

Symposium

Symposium	Symposium and Workshops on Algorithm Theory
Nummer	17
Land/Område	Færøerne
By	Torshavn
Periode	22/06/2020 → 24/06/2020
Internetadresse	https://swat-symposium.org/

Navn	Leibniz International Proceedings in Informatics (LIPIcs)
ISSN	1868-8969

Adgang til dokumentet

10.4230/LIPIcs.SWAT.2020.23Licens: CC BY

Citationsformater

@inproceedings{84cedf4b867d4bf68aba75f438e76ab7,

title = "Trajectory Visibility",

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.",

keywords = "Trajectories, Visibility, Data structures, Semi-algebraic range searching",

author = "Patrick Eades and \{van der Hoog\}, Ivor and Maarten L{\"o}ffler and Frank Staals",

year = "2020",

month = jun,

day = "12",

doi = "10.4230/LIPIcs.SWAT.2020.23",

language = "English",

series = "Leibniz International Proceedings in Informatics (LIPIcs)",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH",

pages = "1--22",

booktitle = "17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)",

note = "Symposium and Workshops on Algorithm Theory , SWAT ; Conference date: 22-06-2020 Through 24-06-2020",

url = "https://swat-symposium.org/",

}

Eades, P, van der Hoog, I, Löffler, M & Staals, F 2020, Trajectory Visibility. i 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics (LIPIcs), s. 1-22, Symposium and Workshops on Algorithm Theory , Torshavn, Færøerne, 22/06/2020. https://doi.org/10.4230/LIPIcs.SWAT.2020.23

Trajectory Visibility. / Eades, Patrick; van der Hoog, Ivor; Löffler, Maarten et al.
17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2020. s. 1-22 (Leibniz International Proceedings in Informatics (LIPIcs)).

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

TY - GEN

T1 - Trajectory Visibility

AU - Eades, Patrick

AU - van der Hoog, Ivor

AU - Löffler, Maarten

AU - Staals, Frank

N1 - Conference code: 17

PY - 2020/6/12

Y1 - 2020/6/12

N2 - 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.

AB - 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.

KW - Trajectories

KW - Visibility

KW - Data structures

KW - Semi-algebraic range searching

U2 - 10.4230/LIPIcs.SWAT.2020.23

DO - 10.4230/LIPIcs.SWAT.2020.23

M3 - Article in proceedings

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 1

EP - 22

BT - 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)

PB - Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH

T2 - Symposium and Workshops on Algorithm Theory

Y2 - 22 June 2020 through 24 June 2020

ER -

Trajectory Visibility

Abstract

Symposium

Adgang til dokumentet

Fingeraftryk

Citationsformater