2026-08-16T08:51:52Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5090 2024-03-06T10:35:50Z ddc:004 open_access

Visualizing Quickest Visibility Maps Talvitie, Topi path planning visibility 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Topi Talvitie 2015 Is Part Of LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SOCG.2015.26 urn:nbn:de:0030-drops-50906 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.26 eng https://creativecommons.org/licenses/by/3.0/legalcode