Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
From MaRDI portal
Publication:2082179
DOI10.1007/s10878-020-00524-0zbMath1502.90180OpenAlexW3000110732MaRDI QIDQ2082179
Tameem Choudhury, Rajasekhar Inkulu
Publication date: 4 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00524-0
Cites Work
- Unnamed Item
- Unnamed Item
- Planar rectilinear shortest path computation using corridors
- Computational geometry in a curved world
- Shortest paths in the plane with convex polygonal obstacles
- Decomposition and intersection of simple splinegons
- Rectilinear shortest paths in the presence of rectangular barriers
- A new data structure for shortest path queries in a simple polygon
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- On parallel rectilinear obstacle-avoiding paths
- Computing minimum length paths of a given homotopy class
- Rectilinear short path queries among rectangular obstacles
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Optimal shortest path queries in a simple polygon
- Two-point L1 shortest path queries in the plane
- A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
- Shortest paths in the plane with polygonal obstacles
- TRIANGULATING DISJOINT JORDAN CHAINS
- Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Computing Shortest Paths among Curved Obstacles in the Plane
- Efficient approximate shortest-path queries among isothetic rectangular obstacles
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Visibility Algorithms in the Plane
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
This page was built for publication: Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
