Pages that link to "Item:Q1388137"
From MaRDI portal
The following pages link to The vertex-edge visibility graph of a polygon (Q1388137):
Displaying 14 items.
- Visible shorelines containing at least \(k\) vertices (Q1587841) (← links)
- Art gallery problem with guards whose range of vision is \(180^{\circ}\) (Q1595400) (← links)
- Orthogonal polygon reconstruction from stabbing information (Q1614070) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- Simple agents learn to find their way: an introduction on mapping polygons (Q2446308) (← links)
- Non-stretchable pseudo-visibility graphs (Q2486082) (← links)
- Computing the visibility polygon from an edge (Q3028356) (← links)
- A Characterization of Visibility Graphs for Pseudo-polygons (Q3452822) (← links)
- Algorithms for Computing Diffuse Reflection Paths in Polygons (Q3605484) (← links)
- (Q4489222) (← links)
- Visibility Graphs of Anchor Polygons (Q5084702) (← links)
- On Colourability of Polygon Visibility Graphs (Q5136313) (← links)
- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH (Q5289293) (← links)
- On colourability of polygon visibility graphs (Q6181985) (← links)