Abstract
We show that in the worst case, Ω(nd) sidedness queries are required to determine whether a set ofn points in ?d is affinely degenerate, i.e., whether it containsd+1 points on a common hyperplane. This matches known upper bounds. We give a straightforward adversary argument, based on the explicit construction of a point set containing Ω(nd) collapsible simplices, any one of which can be made degenerate without changing the orientation of any other simplex. As an immediate corollary, we have an Ω(nd) lower bound on the number of sidedness queries required to determine the order type of a set ofn points in ?d. Using similar techniques, we also show that Ω(nd+1) in-sphere queries are required to decide the existence of spherical degeneracies in a set ofn points in ?d.
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.
