Space-time tradeoffs for emptiness queries (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
| Hi-index | 0.00 |
The author derives a lower bound of /spl Omega/(n/sup 4/3/) for the halfspace emptiness problem: given a set of n points and n hyperplanes in R/sup 5/, is every point above every hyperplane? This matches the best known upper bound to within polylogarithmic factors, and improves the previous best lower bound of /spl Omega/(nlogn). The lower bound applies to partitioning algorithms in which every query region is a polyhedron with a constant number of facets.