Quasi-Valid range querying and its implications for nearest neighbor problems

We define a new formalism called the quasi-valid range aggregation. This formalism leads to a new and quite simple method for reducing non-range query-like problems to range queries and often to orthogonal range queries, with immediate applications to the ATTRACTED NEIGHBOR and the planar ALL-PAIRS NEAREST NEIGHBORS problems (the latter being solved optimally on both parallel and sequential machines). A point of special interest is that our new formalism permits operators “+” that are neither associative nor abelian (unlike traditional range query theory). The technique described in this paper should therefore have significant other applications besides those we consider, especially in the context of parallel computational geometry.

[1]  Dan E. Willard,et al.  New Data Structures for Orthogonal Range Queries , 1985, SIAM J. Comput..

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

[3]  Richard Cole,et al.  Optimal parallel algorithms for polygon and point-set problems , 1988, SCG '88.

[4]  George S. Lueker,et al.  Adding range restriction capability to dynamic data structures , 1985, JACM.

[5]  Jon Louis Bentley,et al.  Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.

[6]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[7]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  Bernard Chazelle Lower bounds on the complexity of multidimensional searching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[9]  D. T. Lee,et al.  Computational Geometry—A Survey , 1984, IEEE Transactions on Computers.

[10]  Andrew Chi-Chih Yao On the Complexity of Maintaining Partial Sums , 1985, SIAM J. Comput..

[11]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[12]  David G. Kirkpatrick,et al.  Parallel processing for efficient subdivision search , 1987, SCG '87.

[13]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[14]  Michael L. Fredman,et al.  The inherent complexity of dynamic data structures which accommodate range queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[15]  Michael Ian Shamos,et al.  A Problem in Multivariate Statistics: Algorithm, Data Structure and Applications. , 1978 .

[16]  Herbert Edelsbrunner,et al.  Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time , 1986, Inf. Process. Lett..

[17]  Bernard Chazelle,et al.  Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[18]  Mark H. Overmars,et al.  Batched Dynamic Solutions to Decomposable Searching Problems , 1985, J. Algorithms.

[19]  Dan E. Willard,et al.  On the application of sheared retrieval to orthogonal range queries , 1986, SCG '86.

[20]  Dan E. Willard Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract) , 1985, STACS.

[21]  George S. Lueker,et al.  A Data Structure for Dynamic Range Queries , 1982, Inf. Process. Lett..

[22]  Mikhail J. Atallah,et al.  Efficient Parallel Solutions to Some Geometric Problems , 1986, J. Parallel Distributed Comput..

[23]  Andrew Chi-Chih Yao,et al.  A general approach to d-dimensional geometric queries , 1985, STOC '85.

[24]  Bernard Chazelle,et al.  Polytope range searching and integral geometry , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[25]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[26]  Bernard Chazelle Slimming down search structures: A functional approach to algorithm design , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[27]  J. Ian Munro,et al.  The Nearest Neighbor Problem on Bounded Domains , 1985, ICALP.

[28]  Pravin M. Vaidya Space-time tradeoffs for orthogonal range queries , 1985, STOC '85.

[29]  Michael L. Fredman,et al.  A Lower Bound on the Complexity of Orthogonal Range Queries , 1981, JACM.

[30]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[31]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[32]  Michael L. Fredman The Spanning Bound as a Measure of Range Query Complexity , 1981, J. Algorithms.

[33]  Hermann A. Maurer,et al.  Efficient worst-case data structures for range searching , 1978, Acta Informatica.