Computing shortest paths among curved obstacles in the plane
From MaRDI portal
(Redirected from Publication:5174497)
Computing shortest paths among curved obstacles in the plane (scientific article; zbMATH DE number 6405150)
Computing shortest paths among curved obstacles in the plane (scientific article; zbMATH DE number 6405150)
Recommendations
- Computing shortest paths among curved obstacles in the plane
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Computing a rectilinear shortest path amid splinegons in plane
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
Cited in
(13)- Shortest curves in planar regions with curved boundary
- Visibility graphs, dismantlability, and the cops and robbers game
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Visibility and ray shooting queries in polygonal domains
- Computing a rectilinear shortest path amid splinegons in plane
- scientific article; zbMATH DE number 4216992 (Why is no real title available?)
- SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
- Computing shortest paths among curved obstacles in the plane
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Navigating weighted regions with scattered skinny tetrahedra
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Computational geometry in a curved world
This page was built for publication: Computing shortest paths among curved obstacles in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174497)