Pages that link to "Item:Q6487941"
From MaRDI portal
The following pages link to Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941):
Displaying 4 items.
- 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 WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)