Pages that link to "Item:Q3910036"
From MaRDI portal
The following pages link to A linear algorithm for computing the visibility polygon from a point (Q3910036):
Displaying 10 items.
- Universal Limit Laws for Depths in Random Trees (Q4210155) (← links)
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (Q4818554) (← links)
- Visibility with multiple reflections (Q5054820) (← links)
- Graphics in flatland revisited (Q5056094) (← links)
- Star unfolding of a polytope with applications (Q5056108) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Optimal Area Polygonization by Triangulation and Visibility Search (Q6163583) (← links)
- Topological art in simple galleries (Q6204773) (← links)
- Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941) (← links)
- Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)