Optimal halfspace range reporting in three dimensions

We give the first optimal solution to a standard problem in computational geometry: three-dimensional halfspace range reporting. We show that n points in 3-d can be stored in a linear-space data structure so that all k points inside a query halfspace can be reported in O(log n + k) time. The data structure can be built in O(n log n) expected time. The previous methods with optimal query time required superlinear (O(n log log n)) space. We also mention consequences, for example, to higher dimensions and to external-memory data structures. As an aside, we partially answer another open question concerning the crossing number in Matousek's shallow partition theorem in the 3-d case (a tool used in many known halfspace range reporting methods).

[1]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

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

[3]  Richard Cole,et al.  Geometric Retrieval Problems , 1983, FOCS.

[4]  Bernard Chazelle,et al.  The power of geometric duality , 1985, BIT Comput. Sci. Sect..

[5]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[6]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[7]  Alok Aggarwal,et al.  Solving query-retrieval problems by compacting Voronoi diagrams , 1990, STOC '90.

[8]  Jirí Matousek,et al.  Reporting Points in Halfspaces , 1992, Comput. Geom..

[9]  Jirí Matousek,et al.  Efficient partition trees , 1992, Discret. Comput. Geom..

[10]  Jyh-Jong Tsay,et al.  External-memory computational geometry , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[11]  Jeffrey Scott Vitter,et al.  On two-dimensional indexability and optimal range search indexing , 1999, PODS '99.

[12]  Edgar A. Ramos,et al.  On range reporting, ray shooting and k-level construction , 1999, SCG '99.

[13]  Timothy M. Chan.  Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions , 2000, SIAM J. Comput..

[14]  Jeffrey Scott Vitter,et al.  Efficient searching with linear constraints , 1998, PODS '98.

[15]  B. CI4AZELLE.  New Upper Bounds for Neighbor Searching , 2005 .

[16]  Pankaj K. Agarwal,et al.  Geometric Range Searching and Its Relatives , 2007 .

[17]  M. Sharir,et al.  On Approximate Halfspace Range Counting and Relative "-Approximations , 2007 .

[18]  Peyman Afshani.  On Dominance Reporting in 3D , 2008, ESA.

[19]  Timothy M. Chan,et al.  Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time , 2009, SIAM J. Comput..

[20]  Timothy M. Chan.  A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries , 2010, J. ACM.

[21]  B.,et al.  Halfspace Range Search : An Algorithmic Application of k-Sets , 2022 .