Reachable region query and its applications
From MaRDI portal
Publication:2201650
DOI10.1016/j.ins.2018.10.010zbMath1442.68045OpenAlexW2896700391WikidataQ129108822 ScholiaQ129108822MaRDI QIDQ2201650
Jian Yin, Zhijie Wang, Bin Yao, Mengdie Nie
Publication date: 29 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.10.010
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the visibility polygon of an island in a polygonal domain
- Some results on point visibility graphs
- Watchman routes for lines and line segments
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Optimal Point Location in a Monotone Subdivision
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- An Optimal Algorithm for Computing Visibility in the Plane
- Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
- Visibility Algorithms in the Plane
This page was built for publication: Reachable region query and its applications