The following pages link to Geometric Avatar Problems (Q2963929):
Displayed 10 items.
- New results on stabbing segments with a polygon (Q474818) (← links)
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Approximation algorithms for geometric conflict free covering problems (Q2206716) (← links)
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- (Q5136221) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)