Computing an L₁ shortest path among splinegonal obstacles in the plane
From MaRDI portal
Publication:2082179
Recommendations
- Computing a rectilinear shortest path amid splinegons in plane
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
Cites work
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane
- A new data structure for shortest path queries in a simple polygon
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Approximate Euclidean shortest paths amid convex obstacles
- Computational geometry in a curved world
- Computational geometry. Algorithms and applications.
- Computing minimum length paths of a given homotopy class
- Computing shortest paths among curved obstacles in the plane
- Decomposition and intersection of simple splinegons
- Efficient approximate shortest-path queries among isothetic rectangular obstacles
- Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
- On parallel rectilinear obstacle-avoiding paths
- Optimal shortest path queries in a simple polygon
- ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
- Planar rectilinear shortest path computation using corridors
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Rectilinear short path queries among rectangular obstacles
- Rectilinear shortest paths in the presence of rectangular barriers
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
- Shortest paths in the plane with convex polygonal obstacles
- Shortest paths in the plane with polygonal obstacles
- TRIANGULATING DISJOINT JORDAN CHAINS
- Two-point L₁ shortest path queries in the plane
- Visibility Algorithms in the Plane
Cited in
(4)
This page was built for publication: Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082179)
