Minimum-width double-slabs and widest empty slabs in high dimensions
From MaRDI portal
Publication:6547941
Cites work
- An optimal convex hull algorithm in any fixed dimension
- Approximating extent measures of points.
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Approximation algorithms for a \(k\)-line center
- Approximation algorithms for orthogonal line centers
- Approximation algorithms for projective clustering
- Computational geometry. Algorithms and applications.
- Cutting hyperplanes for divide-and-conquer
- Diameter, width, closest line pair, and parametric searching
- Efficient randomized algorithms for some geometric optimization problems
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Locating an obnoxious plane
- Minimum-width double-strip and parallelogram annulus
- On lazy randomized incremental construction
- On ray shooting in convex polytopes
- On some geometric selection and optimization problems via sorted matrices
- On the complexity of locating linear facilities in the plane
- On the Zone Theorem for Hyperplane Arrangements
- Point location among hyperplanes and unidirectional ray-shooting
- Range searching with efficient hierarchical cuttings
- Review of obnoxious facilities location problems
- The K-dense corridor problems
- The two-line center problem from a polar view: a new algorithm and data structure
- The widest k-dense corridor problems
Cited in
(3)
This page was built for publication: Minimum-width double-slabs and widest empty slabs in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547941)
