Pages that link to "Item:Q1201747"
From MaRDI portal
The following pages link to Minimum-link paths among obstacles in the plane (Q1201747):
Displaying 20 items.
- Link distance and shortest path problems in the plane (Q634253) (← links)
- A wavefront approach to center location problems with barriers (Q816405) (← links)
- Structured discrete shape approximation: theoretical complexity and practical algorithm (Q824342) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- (Q3301019) (← links)
- Algorithms for Computing Diffuse Reflection Paths in Polygons (Q3605484) (← links)
- Link Distance and Shortest Path Problems in the Plane (Q3638449) (← links)
- ON GEOMETRIC PATH QUERY PROBLEMS (Q4682151) (← links)
- Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons (Q5025050) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons (Q5056907) (← links)
- On geometric path query problems (Q5096943) (← links)
- (Q5116471) (← links)
