Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.26
URN: urn:nbn:de:0030-drops-50906
URL: https://drops.dagstuhl.de/opus/volltexte/2015/5090/
Talvitie, Topi
Visualizing Quickest Visibility Maps
| pdf-format: |
|
Abstract
Consider the following modification to the shortest path query problem in polygonal domains: instead of finding shortest path to a query point q, we find the shortest path to any point that sees q. We present an interactive visualization applet visualizing these quickest visibility paths. The applet also visualizes quickest visibility maps, that is the subdivision of the domain into cells by the quickest visibility path structure.
BibTeX - Entry
@InProceedings{talvitie:LIPIcs:2015:5090,
author = {Topi Talvitie},
title = {{Visualizing Quickest Visibility Maps}},
booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)},
pages = {26--28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-83-5},
ISSN = {1868-8969},
year = {2015},
volume = {34},
editor = {Lars Arge and J{\'a}nos Pach},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5090},
URN = {urn:nbn:de:0030-drops-50906},
doi = {10.4230/LIPIcs.SOCG.2015.26},
annote = {Keywords: path planning, visibility}
}
| Keywords: | path planning, visibility | |
| Seminar: | 31st International Symposium on Computational Geometry (SoCG 2015) | |
| Issue date: | 2015 | |
| Date of publication: | 12.06.2015 |
