Visualizing quickest visibility maps

DOI10.4230/LIPICS.SOCG.2015.26MaRDI QIDQ5368673zbMATH OpenOpenAlexFDO

Authors Topi Talvitie

Publication date 10 October 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.SOCG.2015.26

zbMATH Keywords

visibilitypath planning

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Shortest path to a segment and quickest visibility queries
• Shortest path to a segment and quickest visibility queries
• Quickest visibility queries in polygonal domains
• Quickest visibility queries in polygonal domains
• Query-point visibility constrained shortest paths in simple polygons

Cited in

(3)

• Quickest visibility queries in polygonal domains
• Quickest visibility queries in polygonal domains
• Shortest path to a segment and quickest visibility queries

This page was built for publication: Visualizing quickest visibility maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368673)