Pages that link to "Item:Q5687652"
From MaRDI portal
The following pages link to SHORTEST PATHS AMONG OBSTACLES IN THE PLANE (Q5687652):
Displaying 29 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- The geodesic diameter of polygonal domains (Q368771) (← links)
- A note on visibility-constrained Voronoi diagrams (Q400517) (← links)
- Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
- Geodesic order types (Q486983) (← links)
- Shortest paths without a map (Q809612) (← links)
- Finding shortest path in the presence of barriers: an alternate approach (Q870173) (← links)
- Shortest path planning for a tethered robot (Q904114) (← links)
- The transportation metric and related problems (Q1041811) (← links)
- Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Computation of arc length in the presence of barriers in networks (Q2369184) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
- Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
- Optimal Insertion of a Segment Highway in a City Metric (Q3511373) (← links)
- All Farthest Neighbors in the Presence of Highways and Obstacles (Q3605486) (← links)
- OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM (Q3636311) (← links)
- Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier (Q5039041) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- (Q5111738) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model (Q5943315) (← links)
- Routing among convex polygonal obstacles in the plane (Q6610091) (← links)
