Reachable region query and its applications

DOI10.1016/J.INS.2018.10.010zbMATH Open1442.68045OpenAlexW2896700391WikidataQ129108822 ScholiaQ129108822MaRDI QIDQ2201650FDOQ2201650

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

Recommendations

• Fuzzy distance-based range queries over uncertain moving objects
• Shortest paths in the plane with polygonal obstacles
• ON GEOMETRIC PATH QUERY PROBLEMS
• Safe-region generation methods for continuous trip route planning queries
• Algorithms for Moving Objects Databases

zbMATH Keywords

algorithmsuncertain datamoving target searchlocation-based servicereachable region query

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Searching and sorting (68P10)

Cites Work

• Computational geometry. Algorithms and applications.
• Optimal Point Location in a Monotone Subdivision
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Visibility Algorithms in the Plane
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• An Optimal Algorithm for Computing Visibility in the Plane
• Some results on point visibility graphs
• Computing the visibility polygon of an island in a polygonal domain
• Title not available (Why is that?)
• Title not available (Why is that?)
• Watchman routes for lines and line segments
• Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane

This page was built for publication: Reachable region query and its applications

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