The following pages link to (Q5501788):
Displaying 15 items.
- Minimum-width rectangular annulus (Q388105) (← links)
- Dynamic coresets (Q834605) (← links)
- On overlays and minimization diagrams (Q1014331) (← links)
- Offset-polygon annulus placement problems (Q1276941) (← links)
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center (Q1405006) (← links)
- Computing a minimum-width square annulus in arbitrary orientation (Q1705772) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Covering points with a polygon (Q2477192) (← links)
- Faster core-set constructions and data-stream algorithms in fixed dimensions (Q2507158) (← links)
- Computing a Minimum-Width Square Annulus in Arbitrary Orientation (Q2803818) (← links)
- Minimum Width Rectangular Annulus (Q3004689) (← links)
- Approximate convex intersection detection with applications to width and Minkowski sums (Q5009560) (← links)
- Offset-polygon annulus placement problems (Q5096954) (← links)
- Computing constrained minimum-width annuli of point sets (Q5096955) (← links)
