Pages that link to "Item:Q672401"
From MaRDI portal
The following pages link to Finding an approximate minimum-link visibility path inside a simple polygon (Q672401):
Displaying 6 items.
- Minimum-link watchman tours (Q1007602) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- Fast computation of shortest watchman routes in simple polygons (Q1607078) (← links)
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287) (← links)
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS (Q3628100) (← links)
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons (Q5056907) (← links)
