SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
DOI10.1142/S0218195991000104zbMATH Open0755.68137OpenAlexW2147998016MaRDI QIDQ3986396FDOQ3986396
Authors:
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
Recommendations
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- scientific article; zbMATH DE number 30300
- Rectilinear shortest paths among transient obstacles
- Rectilinear short path queries among rectangular obstacles
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Shortest paths in the plane with polygonal obstacles
- Shortest paths in the plane with convex polygonal obstacles
- Parallel rectilinear shortest paths with rectangular obstacles
- Rectilinear shortest paths in the presence of rectangular barriers
- Approximate Euclidean shortest paths amid convex obstacles
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38)
Cited In (20)
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- Shortest paths with ordinal weights
- Rectilinear short path queries among rectangular obstacles
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
- Paths through a maze of rectangles
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
- Similarity of polygonal curves in the presence of outliers
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
- Computing shortest paths in the plane with removable obstacles
- Path planning in a weighted planar subdivision under the Manhattan metric
- Applications of a numbering scheme for polygonal obstacles in the plane
- A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric
- A catalog of Hanan grid problems
- Rectilinear paths among rectilinear obstacles
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions
- The Fastest Path Between Two Points, with a Symmetric Obstacle
- Planar rectilinear shortest path computation using corridors
- Proximity problems for points on a rectilinear plane with rectangular obstacles
- On geometric path query problems
This page was built for publication: SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986396)
