Efficient colored orthogonal range counting

SIAM Journal on Computing

Volumn 38, Issue 3, 2008, Pages 982-1011

  Kaplan, Haim ^a   Rubin, Natan ^a   Sharir, Micha ^a,b   Verbin, Elad ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Colored orthogonal range counting; Generalized range searching; Matrix multiplication; Output sensitive decomposition; Time space tradeoff; Union of orthants

Indexed keywords

COLORED ORTHOGONAL RANGE COUNTING; GENERALIZED RANGE SEARCHING; MATRIX MULTIPLICATION; OUTPUT-SENSITIVE DECOMPOSITION; TIME-SPACE TRADEOFF; UNION OF ORTHANTS;

COMMUNICATION CHANNELS (INFORMATION THEORY); DATA STRUCTURES; FILE ORGANIZATION; OPTICAL PROPERTIES; PARALLEL ALGORITHMS;

COLOR;

EID: 55249085854     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070684483     Document Type: Article

References (27)

1. J. L. BENTLEY, H. T. KUNG, M. SCHKOLNICK, AND C. D. THOMPSON, On the average number of maxima in a set of vectors and applications, J. ACM, 25 (1978), pp. 536-543.
2. M. DE BERG, M. VAN KREVELD, M. OVERMARS, AND O. SCHWARZKOPF, Computational Geometry: Algorithms and Applications. 2nd ed., Springer-Verlag, Heidelberg, 2000.
3. J.-D. BOISSONNAT, M. SHARIR, B. TAGANSKY, AND M. YVINEC, Voronoi diagrams in higher dimensions under certain polyhedral distance functions, Discrete Comput. Geom., 19 (1998), pp. 485-519.
4. P. BOZANIS, N. KITSIOS, C. MAKRIS, AND A. TSAKALIDIS, New upper bounds for generalized intersection searching problems, in Proceedings of the 22nd Annual International Colloquium on Automata, Languages, and Programming, Szeged, Hungary, 1995, Lecture Notes in Comput. Sci. 944, Springer-Verlag, Berlin, 1995, pp. 464-474.
5. P. BOZANIS, N. KITSIOS, C. MAKRIS, AND A. TSAKALIDIS, Red-blue intersection reporting for objects of non-constant size, Comput. J., 39 (1996), pp. 541-546.
6. P. BOZANIS, N. KITSIOS, C. MAKRIS, AND A. TSAKALIDIS, New results on intersection query problems, Comput. J., 40 (1997), pp. 22-29.
7. T. M. CHAN, Dynamic subgraph connectivity with geometric applications, SIAM J. Comput., 36 (2006), pp. 681-694.
8. L. P. CHEW, D. DOR, A. EFRAT AND K. KEDEM, Geometric pattern matching in d-dimensional space, Discrete Comput. Geom., 21 (1999), pp. 257-274.
9. K. L. CLARKSON AND P. W. SHOR, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
10. D. COPPERSMITH, Rectangular matrix multiplication revisited, J. Complexity, 13 (1997), pp. 42-49.
11. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 251-280.
12. D. GUPTA, R. JANARDAN, AND M. SMID, Computational geometry: Generalized intersection searching, in Handbook of Data Structures and Applications, D. Mehta and S. Sahni, eds., Chapman & Hall/CRC, Boca Raton, FL, 2005, pp. 64-1-64-17.
13. D. GUPTA, R. JANARDAN, AND M. SMID, A technique for adding range restrictions to generalized searching problems, Inform. Process. Lett., 64 (1997), pp. 263-269.
14. D. GUPTA, R. JANARDAN, AND M. SMID, Algorithms for some intersection searching problems involving circular objects, Internat. J. Math. Algorithms, 1 (1999), pp. 35-52.
15. D. GUPTA, R. JANARDAN, AND M. SMID, Algorithms for generalized halfspace range searching and other intersection searching problems, Comput. Geom, 5 (1996), pp. 321-340.
16. D. GUPTA, R. JANARDAN, AND M. SMID, Further results on generalized intersection problems: Counting, reporting, and dynamization, J. Algorithms, 19 (1995), pp. 282-317.
17. S. HAR-PELED, On the Expected Complexity of Random Convex Hulls, Technical report 330/98, School Math. Sci., Tel-Aviv University, Tel-Aviv, Israel, 1998.
18. X. HUANG AND V. Y. PAN, Fast rectangular matrix multiplication and applications, J. Complexity, 14 (1998), pp, 257-299.
19. R. JANARDAN AND M. LOPEZ, Generalized intersection searching problems, Internat. J. Comput. Geom. Appl., 3 (1993), pp. 39-69.
20. H. KAPLAN, M. SHARIR, AND E. VERBIN, Colored intersection searching via sparse rectangular matrix multiplication, in Proceedings of the 22nd Annual ACM Symposium on Computational Geometry, Sedona, AZ, 2006, pp. 52-60.
21. H. KAPLAN, N. RUBIN, M. SHARIR, AND E. VERBIN, Counting colors in boxes, in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 2007, pp. 785-794.
22. J. MATOUŠEK AND O. SCHWARZKOPF, On ray shooting in convex polytopes, Discrete Comput. Geom., 10 (1993), pp, 215-232.
23. J. MATOUŠEK, Efficient partition trees, Discrete Comput. Geom., 8 (1992), pp. 315-334.
24. J. MATOUŠEK, Cutting hyperplane arrangements, Discrete Comput. Geom., 6 (1991), pp. 385-406.
25. J. MATOUŠEK, Range searching with efficient hierarchical cuttings, Discrete Comput. Geom., 10 (1993), pp. 157-182.
26. D. E. WILLARD AND G. S. LUEKER, Adding range restriction capability to dynamic data structures, J. ACM, 32 (1985), pp. 597-617.
27. R. YUSTER AND U. ZWICK, Fast sparse matrix multiplication, ACM Trans. Algorithms, 1 (2005), pp. 2-13.