The following pages link to Intersecting convex sets by rays (Q5896956):
Displaying 10 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Tverberg-type theorems for intersecting by rays (Q629841) (← links)
- Convex blocking and partial orders on the plane (Q902426) (← links)
- Intersection graphs of rays and grounded segments (Q1687911) (← links)
- Modem illumination of monotone polygons (Q1699284) (← links)
- Approximation of zonoids by zonotopes (Q1824151) (← links)
- Coverage with \(k\)-transmitters in the presence of obstacles (Q1944388) (← links)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← links)
- Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
