Pages that link to "Item:Q5375451"
From MaRDI portal
The following pages link to An optimal algorithm for detecting weak visibility of a polygon (Q5375451):
Displaying 17 items.
- LR-visibility in polygons (Q676582) (← links)
- A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- On the number of guard edges of a polygon (Q1312196) (← links)
- Guarding in a simple polygon (Q1607056) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← 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)
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233) (← links)
- AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON (Q4698354) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- Computing a shortest watchman path in a simple polygon in polynomial-time (Q5057427) (← links)
- Finding the shortest boundary guard of a simple polygon (Q5941506) (← links)
- An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. (Q6075910) (← links)
