Visualizing Quickest Visibility Maps

Author Topi Talvitie

Thumbnail PDF


  • Filesize: 317 kB
  • 3 pages

Document Identifiers

Author Details

Topi Talvitie

Cite AsGet BibTex

Topi Talvitie. Visualizing Quickest Visibility Maps. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 26-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


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.
  • path planning
  • visibility


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. E. M. Arkin, A. Efrat, C. Knauer, J. S. B. Mitchell, V. Polishchuk, G. Rote, L. Schlipf, and T. Talvitie. Shortest path to a segment and quickest visibility queries. In SoCG, 2015. Google Scholar
  2. R. Khosravi and M. Ghodsi. The fastest way to view a query point in simple polygons. In European Workshop on Computational Geometry, pages 187-190. Technische Universiteit Eindhoven, 2005. Google Scholar