Proceedings of the 12th Annual ACM Symposium on Computational Geometry, 1-9, 1996.
Abstract:
We show that in the worst case, Omega(n^{ceiling{d/2}-1} + n log n) sidedness queries are required to determine whether the convex hull of n points in R^{d} is simplicial, or to determine the number of convex hull facets. This lower bound matches known upper bounds in any odd dimension. Our result follows from a straightforward and completely constructive adversary argument. A key step in the proof is the construction of a quasisimplicial nvertex polytope with Omega(n^{ceiling{d/2}-1}) degenerate facets. While it has been known for several years that ddimensional convex hulls can have Omega(n^{floor{d/2}}) facets, the previously best lower bound for these problems is only Omega(n log n). Using similar techniques, we also derive simple and correct proofs of Erickson and Seidel's lower bounds for detecting affine degeneracies in arbitrary dimensions and circular degeneracies in the plane. Finally, we show that deciding whether a ddimensional convex hull is simplicial is ceiling{d/2}SUMhard, in the sense of Gajentaan and Overmars.