An optimal algorithm for the minimum-width cubic shell problem
From MaRDI portal
Publication:6556161
DOI10.1016/J.ORL.2023.07.002MaRDI QIDQ6556161
Publication date: 17 June 2024
Published in: Operations Research Letters (Search for Journal in Brave)
Cites Work
- Minimum-width rectangular annulus
- Minimum-width double-strip and parallelogram annulus
- On the minimum-area rectangular and square annulus problem
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- Approximation algorithms for minimum-width annuli and shells
- Computing a minimum-width square annulus in arbitrary orientation
- Efficient randomized algorithms for some geometric optimization problems
- Computing a minimum-width cubic and hypercubic shell
- Empty squares in arbitrary orientation among points
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
- Applications of Parametric Searching in Geometric Optimization
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
This page was built for publication: An optimal algorithm for the minimum-width cubic shell problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556161)