SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
From MaRDI portal
Publication:5687652
Recommendations
- Shortest paths in the plane with polygonal obstacles
- Shortest paths in the plane with obstacle violations
- Shortest paths in the plane with obstacle violations
- Shortest paths in the plane with convex polygonal obstacles
- Finding a shortest pair of paths on the plane with obstacles and crossing areas
- A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS
- Computing shortest paths among curved obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Computing shortest paths in the plane with removable obstacles
- Minimum-link paths among obstacles in the plane
Cited in
(60)- Routing among convex polygonal obstacles in the plane
- Maximal distortion of geodesic diameters in polygonal domains
- Shortest paths without a map
- An exact method for finding shortest routes on a sphere, avoiding obstacles
- Fast optimal and bounded suboptimal Euclidean pathfinding
- Euclidean shortest paths in the presence of rectilinear barriers
- 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
- The shortest path AMID 3-D polyhedral obstacles
- Computation of arc length in the presence of barriers in networks
- On reverse shortest paths in geometric proximity graphs
- Shortest paths in Euclidean graphs
- Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier
- Shortest paths in the plane with obstacle violations
- Shortest paths in the plane with polygonal obstacles
- Shortest path planning for a tethered robot
- Visiting a Polygon on the Optimal Way to a Query Point
- Searching shortest paths on a set of geometric objects
- The Fastest Path Between Two Points, with a Symmetric Obstacle
- Application of the A\(^*\) algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles
- The transportation metric and related problems
- Computational Science and Its Applications – ICCSA 2004
- Optimal Insertion of a Segment Highway in a City Metric
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- scientific article; zbMATH DE number 4216992 (Why is no real title available?)
- The geodesic diameter of polygonal domains
- Approximate Euclidean shortest paths amid convex obstacles
- Shortest paths among transient obstacles
- Finding shortest path in the presence of barriers: an alternate approach
- Routing among convex polygonal obstacles in the plane
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- Visibility graphs and obstacle-avoiding shortest paths
- Computing shortest paths in the plane with removable obstacles
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
- Quickest visibility queries in polygonal domains
- Computing the geodesic centers of a polygonal domain
- Shortest paths in the plane with obstacle violations
- Unobstructed shortest paths in polyhedral environments
- scientific article; zbMATH DE number 910885 (Why is no real title available?)
- Link Distance and Shortest Path Problems in the Plane
- Shortest paths in the plane with convex polygonal obstacles
- Routing in polygonal domains
- Approximate Shortest Paths in Polygons with Violations
- Euclidean shortest paths. Exact or approximate algorithms.
- Routing in polygonal domains
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- The shortest path in a simple polygon with obstacles
- Geodesic order types
- Querying two boundary points for shortest paths in a polygonal domain
- Density-Based Clustering Based on Topological Properties of the Data Set
- Computing shortest paths amid pseudodisks
- scientific article; zbMATH DE number 3845073 (Why is no real title available?)
- A note on visibility-constrained Voronoi diagrams
- OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
- Touring a sequence of disjoint polygons: complexity and extension
- All Farthest Neighbors in the Presence of Highways and Obstacles
- SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
- scientific article; zbMATH DE number 4064475 (Why is no real title available?)
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
- Fast numerical methods based on SDEs for several problems related to the shortest path
This page was built for publication: SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5687652)
