SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
From MaRDI portal
Publication:3986396
DOI10.1142/S0218195991000104zbMath0755.68137OpenAlexW2147998016MaRDI QIDQ3986396
No author found.
Publication date: 27 June 1992
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195991000104
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38)
Related Items (12)
Rectilinear short path queries among rectangular obstacles ⋮ On geometric path query problems ⋮ Path planning in a weighted planar subdivision under the Manhattan metric ⋮ Similarity of polygonal curves in the presence of outliers ⋮ Proximity problems for points on a rectilinear plane with rectangular obstacles ⋮ A catalog of Hanan grid problems ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric ⋮ Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications ⋮ Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane ⋮ Rectilinear paths among rectilinear obstacles ⋮ Computing Shortest Paths in the Plane with Removable Obstacles
This page was built for publication: SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
