Pages that link to "Item:Q5056171"
From MaRDI portal
The following pages link to Finding all weakly-visible chords of a polygon in linear time (Q5056171):
Displaying 6 items.
- Characterizing and recognizing weak visibility polygons (Q686142) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622) (← links)
- Computing a shortest watchman path in a simple polygon in polynomial-time (Q5057427) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
- Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941) (← links)