An optimal algorithm for the minimum-width cubic shell problem

DOI10.1016/J.ORL.2023.07.002MaRDI QIDQ6556161zbMATH OpenFDO

Authors Sang Won Bae

Publication date 17 June 2024

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2023.07.002

zbMATH Keywords

cubic shellfacility locationgeometric optimizationminimum widthoptimal algorithm

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
• Applications of Parametric Searching in Geometric Optimization
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Approximation algorithms for minimum-width annuli and shells
• Computing a minimum-width cubic and hypercubic shell
• Computing a minimum-width square annulus in arbitrary orientation
• Efficient randomized algorithms for some geometric optimization problems
• Empty squares in arbitrary orientation among points
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• Minimum-width double-strip and parallelogram annulus
• Minimum-width rectangular annulus
• On the minimum-area rectangular and square annulus problem
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Voronoui Diagrams in L₁ (L_\infty ) Metrics with 2-Dimensional Storage Applications

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)