Abstract
A (hyper-)cuboid, also known as a hyper-rectangle or a box, is a compact body of dimension three or higher, extending its two-dimensional analog, rectangles. A cuboidal shell is the compact volume between a cuboid and its inward offset. In this paper, we address the problem of computing a minimum-width cuboidal shell that encloses at least n – k points out of n given points in RSUPd/SUP when d ≥ 3. The number k is given as input and the k excluded points as a result are considered outliers of the n input points. Prior to our work, there was no known algorithm for the cuboidal shell problem considering outliers. We solve the problem for the first time by presenting two efficient algorithms. Our algorithms run in O(kSUP2d/SUP n) time and O(n) space or in O(n logSUPd-1/SUP n + kSUP2d/SUP logSUPd/SUP n) time and O(n logSUPd-1/SUP n) space.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
