Pages that link to "Item:Q4876693"
From MaRDI portal
The following pages link to An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons (Q4876693):
Displaying 11 items.
- Covering moving points with anchored disks (Q421753) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- Approximating largest convex hulls for imprecise points (Q1002103) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Computing \(k\)-centers of uncertain points on a real line (Q2157899) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints (Q2795940) (← links)
- Approximating Largest Convex Hulls for Imprecise Points (Q5443375) (← links)