Pages that link to "Item:Q1614066"
From MaRDI portal
The following pages link to Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066):
Displaying 8 items.
- Rotationally monotone polygons (Q1025304) (← links)
- Recognizing weakly convex visible polygons (Q1392848) (← links)
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment (Q4033762) (← links)
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233) (← links)
- Open Guard Edges and Edge Guards in Simple Polygons (Q4899264) (← links)
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments (Q5054843) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941) (← links)