Pages that link to "Item:Q4033762"
From MaRDI portal
The following pages link to An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment (Q4033762):
Displaying 11 items.
- LR-visibility in polygons (Q676582) (← links)
- Recognizing weakly convex visible polygons (Q1392848) (← links)
- Guarding in a simple polygon (Q1607056) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Line segment visibility with sidedness constraints (Q2144449) (← links)
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233) (← links)
- An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
- Finding the shortest boundary guard of a simple polygon (Q5941506) (← links)
- Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941) (← links)
