Pages that link to "Item:Q5056095"
From MaRDI portal
The following pages link to The visibility diagram: A data structure for visibility problems and motion planning (Q5056095):
Displaying 6 items.
- On a class of \(O(n^2)\) problems in computational geometry (Q419363) (← links)
- Randomized approximation algorithms for planar visibility counting problem (Q1685962) (← links)
- On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639) (← links)
- Visibility testing and counting (Q2346552) (← links)
- Visibility testing and counting for uncertain segments (Q2420576) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
