The following pages link to (Q3787487):
Displaying 13 items.
- Characterizing and recognizing weak visibility polygons (Q686142) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Weak visibility counting in simple polygons (Q2351072) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment (Q4033762) (← links)
- (Q4371242) (← links)
- AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON (Q4698354) (← links)
- An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146) (← links)
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918442) (← links)
- Three dimensional weak visibility: Complexity and applications (Q6064014) (← links)
- An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. (Q6075910) (← links)
