Halfspace range search: An algorithmic application ofk-sets

Given a fixed setS ofn points inE3 and a query planeπ, the halfspace range search problem asks for the retrieval of all points ofS on a chosen side ofπ. We prove that withO(n(logn)8 (loglogn)4) storage it is possible to solve this problem inO(k+logn) time, wherek is the number of points to be reported. This result rests crucially on a new combinatorial derivation. We show that the total number ofj-sets (j=1, ...,k) realized by a set ofn points inE3 isO(nk5); ak-set is any subset ofS of sizek which can be separated from the rest ofS by a plane.

[1]  Leonidas J. Guibas,et al.  The power of geometric duality , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[2]  Richard Cole,et al.  New Upper Bounds for Neighbor Searching , 1986, Inf. Control..

[3]  Bernard Chazelle.  Filtering Search: A New Approach to Query-Answering , 1983, FOCS.

[4]  Jon Louis Bentley,et al.  Decomposable Searching Problems , 1979, Inf. Process. Lett..

[5]  P. Erdös,et al.  Dissection Graphs of Planar Point Sets , 1973 .

[6]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  D. T. Lee,et al.  On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[8]  Raimund Seidel,et al.  Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..

[9]  Richard Cole,et al.  On k-hulls and related problems , 1984, STOC '84.

[10]  Hermann A. Maurer,et al.  A Note on Euclidean Near Neighbor Searching in the Plane , 1979, Inf. Process. Lett..

[11]  Richard Cole,et al.  Geometric retrieval problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).