Pages that link to "Item:Q1380799"
From MaRDI portal
The following pages link to An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (Q1380799):
Displaying 28 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Visibility queries in a polygonal region (Q833709) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- Shortest path planning for a tethered robot (Q904114) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Honey-pot constrained searching with local sensory information (Q2507866) (← links)
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057) (← links)
- Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
- Shortest Path Queries in Polygonal Domains (Q3511429) (← links)
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS (Q4818544) (← links)
- Minimizing Distance-to-Sight in Polygonal Domains (Q5091052) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Navigating Weighted Regions with Scattered Skinny Tetrahedra (Q5370569) (← links)
- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures (Q5458853) (← links)
- Routing among convex polygonal obstacles in the plane (Q6610091) (← links)
