Pages that link to "Item:Q1096432"
From MaRDI portal
The following pages link to Visibility between two edges of a simple polygon (Q1096432):
Displaying 16 items.
- Reasoning about visibility (Q420853) (← links)
- An optimal algorithm for finding the edge visibility polygon under limited visibility (Q673918) (← links)
- LR-visibility in polygons (Q676582) (← links)
- Computing shortest transversals (Q757096) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- Reconstructing visible regions from visible segments (Q1090463) (← links)
- Corrections to Lee's visibility polygon algorithm (Q1102120) (← links)
- Three-dimensional weak visibility: Complexity and applications (Q1575678) (← links)
- Line segment visibility with sidedness constraints (Q2144449) (← links)
- Characterizing and recognizing LR-visibility polygons (Q2448917) (← links)
- Computing the visibility polygon from an edge (Q3028356) (← links)
- Open Guard Edges and Edge Guards in Simple Polygons (Q4899264) (← links)
- (Q4945520) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- Three dimensional weak visibility: Complexity and applications (Q6064014) (← links)