Nearly neighbourly families of standard boxes
Jacek Bojarski, Andrzej P. Kisielewicz, Krzysztof Przes{\l}awski

TL;DR
This paper proves that nearly neighbourly families of standard boxes in three-dimensional space have a maximum of 12 elements, classifies all such maximal families, and discusses properties like incompressibility.
Contribution
It establishes an upper bound of 12 for nearly neighbourly families of standard boxes in 3D and provides a complete classification of maximal families.
Findings
Maximum of 12 elements in nearly neighbourly families
Complete classification of families with exactly 12 elements
Discussion of incompressible and compressible families
Abstract
It is demonstrated that each nearly neighbourly family of standard boxes in has at most 12 elements. A combinatorial classification of all such families that have exactly 12 elements is given. All families satisfying an extra property called incompressibility are described. Compressible families are discussed briefly.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
