Pages that link to "Item:Q4818546"
From MaRDI portal
The following pages link to APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546):
Displaying 36 items.
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- Certified efficient global roundness evaluation (Q779864) (← links)
- On the minimum-area rectangular and square annulus problem (Q827319) (← links)
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width (Q833568) (← links)
- Dynamic coresets (Q834605) (← links)
- Fitting enclosing cylinders to data in \(\mathbb R^n\) (Q861741) (← links)
- How to get close to the median shape (Q870425) (← links)
- Approximating largest convex hulls for imprecise points (Q1002103) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- On overlays and minimization diagrams (Q1014331) (← links)
- Computing a minimum-width square annulus in arbitrary orientation (Q1705772) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
- Smallest enclosing cylinders (Q1977135) (← links)
- Window queries for intersecting objects, maximal points and approximations using coresets (Q2235286) (← links)
- Computing a minimum-width cubic and hypercubic shell (Q2294346) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Approximate minimum diameter (Q2412413) (← links)
- On finding a large number of 3D points with a small diameter (Q2457016) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- Faster core-set constructions and data-stream algorithms in fixed dimensions (Q2507158) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- Computing a Minimum-Width Square Annulus in Arbitrary Orientation (Q2803818) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS (Q3007722) (← links)
- Estimating the Length of Material Wrapped Around a Cylindrical Core (Q3702887) (← links)
- CYLINDRICAL HIERARCHY FOR DEFORMING NECKLACES (Q4818593) (← links)
- Approximate convex intersection detection with applications to width and Minkowski sums (Q5009560) (← links)
- FITTING FLATS TO POINTS WITH OUTLIERS (Q5388712) (← links)
- Approximating Largest Convex Hulls for Imprecise Points (Q5443375) (← links)
- GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS (Q5470168) (← links)
- Radii minimal projections of polytopes and constrained optimization of symmetric polynomials (Q5488627) (← links)
- Minimum-width annulus with outliers: circular, square, and rectangular cases (Q5915962) (← links)
- Robust shape fitting via peeling and grating coresets (Q5920504) (← links)
- Minimum-width double-slabs and widest empty slabs in high dimensions (Q6547941) (← links)
- An optimal algorithm for the minimum-width cubic shell problem (Q6556161) (← links)
