On geometric path query problems
From MaRDI portal
Publication:5096943
DOI10.1007/3-540-63307-3_64zbMath1497.68521MaRDI QIDQ5096943
Ovidiu Daescu, Danny Z. Chen, Kevin S. Klenk
Publication date: 19 August 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63307-3_64
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum-link paths among obstacles in the plane
- Finding level-ancestors in trees
- Topologically sweeping visibility complexes via pseudotriangulations
- On Some Distance Problems in Fixed Orientations
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Rectilinear Path Problems among Rectilinear Obstacles Revisited
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- Matrix searching with the shortest path metric
- THE VISIBILITY COMPLEX