SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
From MaRDI portal
Publication:3986396
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
Cited in
(20)- Planar rectilinear shortest path computation using corridors
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
- Path planning in a weighted planar subdivision under the Manhattan metric
- Applications of a numbering scheme for polygonal obstacles in the plane
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- Similarity of polygonal curves in the presence of outliers
- The Fastest Path Between Two Points, with a Symmetric Obstacle
- Proximity problems for points on a rectilinear plane with rectangular obstacles
- Rectilinear paths among rectilinear obstacles
- A catalog of Hanan grid problems
- Computing shortest paths in the plane with removable obstacles
- Shortest paths with ordinal weights
- Rectilinear short path queries among rectangular obstacles
- Paths through a maze of rectangles
- On geometric path query problems
- A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
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)