Rectilinear short path queries among rectangular obstacles
From MaRDI portal
Publication:1351630
DOI10.1016/0020-0190(96)00020-8zbMath0875.68307OpenAlexW2080239516WikidataQ127883979 ScholiaQ127883979MaRDI QIDQ1351630
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(96)00020-8
AlgorithmsComputational geometryData structuresAnalysis of algorithmsShortest pathDesign of algorithms
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (4)
Planar rectilinear shortest path computation using corridors ⋮ ON GEOMETRIC PATH QUERY PROBLEMS ⋮ ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS ⋮ Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rectilinear shortest paths in the presence of rectangular barriers
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Parallel rectilinear shortest paths with rectangular obstacles
- On parallel rectilinear obstacle-avoiding paths
- Finding level-ancestors in trees
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Fast Algorithms for Finding Nearest Common Ancestors
- Optimal Point Location in a Monotone Subdivision
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Applications of a Planar Separator Theorem
- Finding minimum rectilinear distance paths in the presence of barriers
- Optimal Search in Planar Subdivisions
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
- Efficient approximate shortest-path queries among isothetic rectangular obstacles
This page was built for publication: Rectilinear short path queries among rectangular obstacles
