Geometric avatar problems
From MaRDI portal
Publication:2963929
Recommendations
Cited in
(10)- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Fréchet distance between a line and avatar point set
- New results on stabbing segments with a polygon
- Network optimization on partitioned pairs of points
- Minimum color spanning circle of imprecise points
- On the \(k\)-colored rainbow sets in fixed dimensions
- Parameterized complexity of geometric covering problems having conflicts
- Selecting and covering colored points
- Minimum color spanning circle in imprecise setup
- Approximation algorithms for geometric conflict free covering problems
This page was built for publication: Geometric avatar problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963929)