Shortest path to a segment and quickest visibility queries

DOI10.4230/LIPIcs.SOCG.2015.658zbMath1378.68150OpenAlexW3023933209MaRDI QIDQ5368719

Joseph S. B. Mitchell, Christian Knauer, Günter Rote, Valentin Polishchuk, Topi Talvitie, Esther M. Arkin, Lena Schlipf, Alon Efrat

Publication date: 10 October 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.SOCG.2015.658

zbMATH Keywords

complexitypath planningvisibilitycontinuous Dijkstrapersistent data structuresquery structures

Mathematics Subject Classification ID

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

Related Items (1)

Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons

This page was built for publication: Shortest path to a segment and quickest visibility queries