The following pages link to ON GEOMETRIC PATH QUERY PROBLEMS (Q4682151):
Displaying 6 items.
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Structured discrete shape approximation: theoretical complexity and practical algorithm (Q824342) (← links)
- Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- (Q5088992) (← links)
- Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468) (← links)
