Minimum-width double-slabs and widest empty slabs in high dimensions

DOI10.1016/J.COMGEO.2025.102173MaRDI QIDQ6964871zbMATH OpenFDO

Authors Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon

Publication date 4 July 2025

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COMGEO.2025.102173

zbMATH Keywords

double-slabhyperplaneminimum-width double-slabwidest empty slab

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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 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 upper envelope of piecewise linear functions: Algorithms and applications
• The widest k-dense corridor problems

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 Q6964871)