Pages that link to "Item:Q686142"
From MaRDI portal
The following pages link to Characterizing and recognizing weak visibility polygons (Q686142):
Displaying 21 items.
- On recognizing and characterizing visibility graphs of simple polygons (Q677018) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← 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)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← 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)
- Weak visibility counting in simple polygons (Q2351072) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- Visibility concepts in orthogonal polygon recognition (Q2748192) (← links)
- Recognizing weakly simple polygons (Q3132840) (← links)
- Determining Weak Visibility of a Polygon from an Edge in Parallel (Q4513212) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- (Q5111878) (← links)
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918442) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
- Disproving a conjecture on planar visibility graphs (Q5941094) (← links)
- Three dimensional weak visibility: Complexity and applications (Q6064014) (← links)
