Sökning: onr:"swepub:oai:DiVA.org:liu-128034" >
Shortest path to a ...
Shortest path to a segment and quickest visibility queries
-
- Arkin, Esther M (författare)
- Stony Brook University, USA,
-
- Efrat, Alon (författare)
- Computer Science, the University of Arizona, USA,
-
- Knauer, Christian (författare)
- Institute of Computer Science, Universitat Bayreuth, Germany,
-
visa fler...
-
- Mitchell, Joseph SB (författare)
- Stony Brook University, USA,
-
- Polishchuk, Valentin (författare)
- Linköpings universitet,Kommunikations- och transportsystem,Tekniska fakulteten
-
- Rote, Günter (författare)
- Institute of Computer Science, Freie Universitat Berlin, Germany,
-
- Schlipf, Lena (författare)
- Institute of Computer Science, Freie Universitat Berlin, Germany,
-
- Talvitie, Topi (författare)
- Department of Computer Science, University of Finland
-
visa färre...
-
(creator_code:org_t)
- 2016
- 2016
- Engelska.
-
Ingår i: LIPIcs-Leibniz International Proceedings in Informatics. ; , s. 77-100
- Relaterad länk:
-
http://jocg.org/inde...
-
visa fler...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- We show how to preprocess a polygonal domain with a xed starting point s in order to answer eciently the following queries: Given a point q, how should one move from s in order to see q as soon as possible? This query resembles the well-known shortestpath- to-a-point query, except that the latter asks for the fastest way to reach q, instead of seeing it. Our solution methods include a data structure for a di erent generalization of shortest-path-to-a-point queries, which may be of independent interest: to report eciently a shortest path from s to a query segment in the domain.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)