liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Shortest path to a segment and quickest visibility queries
Stony Brook University, USA,.
Computer Science, the University of Arizona, USA,.
Institute of Computer Science, Universitat Bayreuth, Germany,.
Stony Brook University, USA,.
Show others and affiliations
2016 (English)In: LIPIcs-Leibniz International Proceedings in Informatics, 2016, Vol. 7, 77-100 p.Conference paper (Refereed)Text
Abstract [en]

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.

Place, publisher, year, edition, pages
2016. Vol. 7, 77-100 p.
, Journal of Computational Geometry, ISSN 1920-180X
National Category
Computer Science
URN: urn:nbn:se:liu:diva-128034OAI: diva2:928731
SoCG 15
Available from: 2016-05-16 Created: 2016-05-16 Last updated: 2016-05-25

Open Access in DiVA

No full text

Other links

Search in DiVA

By author/editor
Polishchuk, Valentin
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 46 hits
ReferencesLink to record
Permanent link

Direct link