Computing shortest paths in the plane with removable obstacles
From MaRDI portal
Publication:5116468
stochastic shortest pathsEuclidean shortest paths\(L_1\) shortest pathsremovable polygonal obstacles
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Recommendations
- Shortest paths in the plane with convex polygonal obstacles
- Shortest paths in the plane with polygonal obstacles
- A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Shortest paths in the plane with obstacle violations
Cites work
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane
- A new algorithm for computing visibility graphs of polygonal obstacles in the plane
- Algorithms and Computation
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
- Computing shortest paths amid convex pseudodisks
- Computing shortest paths among curved obstacles in the plane
- Computing shortest paths with uncertainty
- Low-Dimensional Linear Programming with Violations
- ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
- ON GEOMETRIC PATH QUERY PROBLEMS
- On geometric optimization with few violated constraints
- Planar rectilinear shortest path computation using corridors
- Rectilinear Path Problems among Rectilinear Obstacles Revisited
- Rectilinear paths among rectilinear obstacles
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- Shortest path problem with uncertain arc lengths
- Shortest paths in the plane with obstacle violations
- Stochastic minimum spanning trees in Euclidean spaces
- The weighted region problem
- Visibility Algorithms in the Plane
- k-violation linear programming
Cited in
(8)- SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
- Shortest paths among transient obstacles
- Approximate Shortest Paths in Polygons with Violations
- Improved approximation bounds for the minimum constraint removal problem
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Removing Connected Obstacles in the Plane is FPT
- Shortest paths in the plane with obstacle violations
- Improved approximation bounds for the minimum constraint removal problem
This page was built for publication: Computing shortest paths in the plane with removable obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116468)
