Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
From MaRDI portal
Publication:4943866
DOI10.1137/S0097539796307194zbMath0947.68073OpenAlexW1992176147MaRDI QIDQ4943866
Hung-Yi T. Tu, Danny Z. Chen, Kevin S. Klenk
Publication date: 19 March 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539796307194
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Computation of arc length in the presence of barriers in networks ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Computing a maxian point of a simple rectilinear polygon ⋮ Finding shortest path in the presence of barriers: an alternate approach ⋮ Approximate distance oracles for graphs with dense clusters ⋮ Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ On geometric path query problems ⋮ Path planning in a weighted planar subdivision under the Manhattan metric ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Unnamed Item ⋮ ON GEOMETRIC PATH QUERY PROBLEMS ⋮ ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS ⋮ Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane ⋮ Computing Shortest Paths in the Plane with Removable Obstacles
