ON GEOMETRIC PATH QUERY PROBLEMS
From MaRDI portal
Publication:4682151
DOI10.1142/S0218195901000675zbMath1074.68632MaRDI QIDQ4682151
Ovidiu Daescu, Danny Z. Chen, Kevin S. Klenk
Publication date: 10 June 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (6)
Minimum-link shortest paths for polygons amidst rectilinear obstacles ⋮ Structured discrete shape approximation: theoretical complexity and practical algorithm ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ Unnamed Item ⋮ Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane ⋮ Computing Shortest Paths in the Plane with Removable Obstacles
Cites Work
- A new data structure for shortest path queries in a simple polygon
- On graphs preserving rectilinear shortest paths in the presence of obstacles
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Parallel rectilinear shortest paths with rectangular obstacles
- Minimum-link paths among obstacles in the plane
- On parallel rectilinear obstacle-avoiding paths
- Rectilinear short path queries among rectangular obstacles
- Rectilinear paths among rectilinear obstacles
- Optimal Point Location in a Monotone Subdivision
- Applications of a Planar Separator Theorem
- Optimal Search in Planar Subdivisions
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
This page was built for publication: ON GEOMETRIC PATH QUERY PROBLEMS
