Pages that link to "Item:Q686142"
From MaRDI portal
The following pages link to Characterizing and recognizing weak visibility polygons (Q686142):
Displaying 11 items.
- On recognizing and characterizing visibility graphs of simple polygons (Q677018) (← links)
- An algorithm for recognizing palm polygons (Q1345480) (← links)
- Recognizing weakly convex visible polygons (Q1392848) (← links)
- Three-dimensional weak visibility: Complexity and applications (Q1575678) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- Optimal placement of base stations in border surveillance using limited capacity drones (Q2079881) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- (Q5111878) (← links)
- Three dimensional weak visibility: Complexity and applications (Q6064014) (← links)
