Pages that link to "Item:Q5096146"
From MaRDI portal
The following pages link to An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146):
Displayed 6 items.
- On rectilinear link distance (Q808302) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Visibility with multiple diffuse reflections (Q1392849) (← links)
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105) (← links)
- Parallel algorithms for all minimum link paths and link center problems (Q5056133) (← links)