Pages that link to "Item:Q3511429"
From MaRDI portal
The following pages link to Shortest Path Queries in Polygonal Domains (Q3511429):
Displaying 15 items.
- The geodesic diameter of polygonal domains (Q368771) (← links)
- Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
- Fast computation of shortest watchman routes in simple polygons (Q1607078) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- The polygon burning problem (Q2154090) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Shortest path to a segment and quickest visibility queries (Q2970466) (← links)
- Approximate Shortest Path Queries Using Voronoi Duals (Q3052756) (← links)
- Querying Approximate Shortest Paths in Anisotropic Regions (Q3053153) (← links)
- (Q4763413) (← links)
- (Q5088992) (← links)
- A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains (Q5120154) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- Shortest Path in a Polygon using Sublinear Space. (Q5368680) (← links)
- Shortest rectilinear path queries to rectangles in a rectangular domain (Q5896842) (← links)