Abstract
Given a set of n points in R3, the minimum-width cubic shell problem asks to find a thinnest cubic shell that encloses the input points, where a cubic shell refers to as a closed volume between two concentric axis-aligned cubes. In this paper, we improve the previous O(nlog2n)-time algorithm presented in Bae (2019) [6] to O(nlogn) worst-case time. This is the first optimal-time algorithm to the problem.
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.
