By Topic

Better lower bounds on detecting affine and spherical degeneracies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Erickson, J. ; Div. of Comput. Sci., California Univ., Berkeley, CA, USA ; Seidel, R.

We show that in the worst case, Ω(nd) sidedness queries are required to determine whether a set of n points in Rd is affinely degenerate, i.e., whether it contains d+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 of n points in Rd. Using similar techniques, we also show that Ω(nd+1) in-sphere queries are required to decide the existence of spherical degeneracies in a set of n points in Rd

Published in:

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Date of Conference:

3-5 Nov 1993