On Dominance Reporting in 3D

In this paper, we study the 3D dominance reporting problem in different models of computations and offer optimal results in the pointer machine and the external memory models and a near optimal result in the RAM model; all our results consume linear space. We can answer queries in O(log n+ k) time on a pointer machine, with O(log B n+ k/B) I/Os in the external memory model and in O((log logn)2+ log log U+ k) time in the RAM model and in a U×U×Uinteger grid. These improve the results of various papers, such as Makris and Tsakalidis (IPL'98), Vengroff and Vitter (STOC'96) and Nekrich (SOCG'07). Here, n, kand Bare the input, output and block size respectively. With a log3nfold increase in the space complexity these can be turned into orthogonal range reporting algorithms with matching query times, improving the previous orthogonal range searching results in the pointer machine and RAM models. Using our 3D results as base cases, we can provide improved orthogonal range reporting algorithms in i¾?d, di¾? 4. We use randomization only in the preprocessing part and our query bounds are all worst case.

[1]  Yakov Nekrich.  A data structure for multi-dimensional range reporting , 2007, SCG '07.

[2]  Mark H. Overmars,et al.  On the Equivalence of Some Rectangle Problems , 1982, Inf. Process. Lett..

[3]  Pankaj K. Agarwal.  Range Searching , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[4]  Bernard Chazelle,et al.  A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..

[5]  Joseph JáJá,et al.  Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting , 2004, ISAAC.

[6]  Bernard Chazelle,et al.  Linear space data structures for two types of range search , 1987, Discret. Comput. Geom..

[7]  Christos Makris,et al.  Algorithms for Three-Dimensional Dominance Searching in Linear Space , 1998, Inf. Process. Lett..

[8]  Eduardo Sany Laber,et al.  LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings , 2008, Lecture Notes in Computer Science.

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

[10]  Sridhar Ramaswamy,et al.  The P-range tree: a new data structure for range searching in secondary memory , 1995, SODA '95.

[11]  Jeffrey Scott Vitter,et al.  Efficient searching with linear constraints , 1998, J. Comput. Syst. Sci..

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

[13]  Stephen Alstrup,et al.  New data structures for orthogonal range searching , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[14]  Mark de Berg,et al.  Two- and Three-Dimensional Point Location in Rectangular Subdivisions , 1995, J. Algorithms.

[15]  Jeffrey Scott Vitter,et al.  Efficient 3-D range searching in external memory , 1996, STOC '96.

[16]  Yakov Nekrich.  I/O-Efficient Point Location in a Set of Rectangles , 2008, LATIN.

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

[18]  Micha Sharir,et al.  Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications , 1999, SIAM J. Comput..

[19]  R. Pollack,et al.  Advances in Discrete and Computational Geometry , 1999 .

[20]  Micha Sharir,et al.  On approximate halfspace range counting and relative epsilon-approximations , 2007, SCG '07.

[21]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.