Minimum-width double-slabs and widest empty slabs in high dimensions
From MaRDI portal
Publication:6547941
DOI10.1007/978-3-031-55598-5_20MaRDI QIDQ6547941
Hee-Kap Ahn, Otfried Cheong, Chaeyoon Chung, Sang Duk Yoon, Taehoon Ahn, Sang Won Bae
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Range searching with efficient hierarchical cuttings
- Diameter, width, closest line pair, and parametric searching
- On ray shooting in convex polytopes
- Minimum-width double-strip and parallelogram annulus
- Approximation algorithms for a \(k\)-line center
- Cutting hyperplanes for divide-and-conquer
- On some geometric selection and optimization problems via sorted matrices
- The widest k-dense corridor problems
- An optimal convex hull algorithm in any fixed dimension
- Point location among hyperplanes and unidirectional ray-shooting
- Efficient randomized algorithms for some geometric optimization problems
- On the complexity of locating linear facilities in the plane
- Locating an obnoxious plane
- Review of obnoxious facilities location problems
- Approximating extent measures of points
- On the Zone Theorem for Hyperplane Arrangements
- The K-dense corridor problems
- Approximation algorithms for projective clustering
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- The two-line center problem from a polar view: a new algorithm and data structure
- On lazy randomized incremental construction
- Approximation algorithms for orthogonal line centers
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)
