Let S be a set of n points in three-dimensional Euclidean space. We consider the problem of positioning a plane π intersecting the convex hull of S such that min{d(π,p);p ∈ S} is maximized. In a geometric setting, the problem asks for the widest empty slab through n points in space, where a slab is the open region of ℝ3 that is bounded by two parallel planes that intersect the convex hull of S. We give a characterization of the planes which are locally optimal and we show that the problem can be solved in O(n3) time and O(n2) space. We also consider several variants of the problem which include constraining the obnoxious plane to contain a given line or point and computing the widest empty slab for polyhedral obstacles. Finally, we show how to adapt our method for computing a largest empty annulus in the plane, improving the known time bound O(n3 log n) [6]. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Díaz-Báñez, J. M., López, M. A., & Sellarès, J. A. (2004). Computing largest empty slabs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3045, 99–108. https://doi.org/10.1007/978-3-540-24767-8_11
Mendeley helps you to discover research relevant for your work.