Pages that link to "Item:Q419498"
From MaRDI portal
The following pages link to Querying two boundary points for shortest paths in a polygonal domain (Q419498):
Displaying 5 items.
- The geodesic diameter of polygonal domains (Q368771) (← links)
- A new data structure for shortest path queries in a simple polygon (Q1178232) (← links)
- Shortest Path Queries in Polygonal Domains (Q3511429) (← links)
- (Q5116471) (← links)
- A divide-and-conquer algorithm for two-point L1 shortest path queries in polygonal domains (Q5120154) (← links)