Shortest path to a segment and quickest visibility queries
From MaRDI portal
Publication:2970466
DOI10.20382/jocg.v7i2a5zbMath1405.68392OpenAlexW2278760039MaRDI QIDQ2970466
Topi Talvitie, Lena Schlipf, Christian Knauer, Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Alon Efrat
Publication date: 30 March 2017
Full work available at URL: https://doaj.org/article/6cabca0373824e5fa0efdfd870399d35
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (5)
Minimizing Distance-to-Sight in Polygonal Domains ⋮ Quickest visibility queries in polygonal domains ⋮ On Romeo and Juliet problems: minimizing distance-to-sight ⋮ On Romeo and Juliet Problems: Minimizing Distance-to-Sight. ⋮ How to Keep an Eye on Small Things
This page was built for publication: Shortest path to a segment and quickest visibility queries
