Colored intersection searching via sparse rectangular matrix multiplication

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 52-60

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

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Colored intersection searching; Generalized intersection searching; Matrix multiplication; Range searching

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; PROBLEM SOLVING;

COLORED INTERSECTION SEARCHING; GENERALIZED INTERSECTION SEARCHING; MATRIX MULTIPLICATION; RANGE SEARCHING;

MATRIX ALGEBRA;

EID: 33748052687     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137866     Document Type: Conference Paper

References (21)

1. P. K. Agarwal, S. Bereg, O. Daescu, H. Kaplan, S. Ntafos, and B. Zhu. Guarding a terrain by two watchtowers. In Proc. 21st Annu. ACM Sympos. Computational Geometry, pages 346-355, New York, NY, USA, 2005. ACM Press.
2. n and the discrete planar two-watchtower problem, Inform. Process. Lett. 89 (2004), 137-139
3. P. Bozanis, N. Kitsios, C. Makris, and A. K. Tsakalidis. Red-blue intersection reporting for objects of non-constant size. Comput. J., 39(6):541-546, 1996.
4. B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9(2):145-158, 1993.
5. B. Chazelle. Handbook of Data Structures and Applications, chapter 25, Cuttings, pages 25.1-25.10, CRC Press, 2005.
6. H. Cohn, R. D. Kleinberg, B. Szegedy, and C. Umans. Group-theoretic algorithms for matrix multiplication. In Proc. 46th Annu. IEEE Sympos. Foundat. Comput. Sci. (FOCS '05), pages 379-388.
7. H. Cohn and C. Umans. A group-theoretic approach to fast matrix multiplication. In Proc. 44th Annu. IEEE Sympos. Foundat. Comput. Sci. (FoOCS '03), pages 438-449.
8. D. Coppersmith. Rectangular matrix multiplication revisited. J. Complexity, 13(1):42-49, 1997.
9. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9(3):251-280, 1990.
10. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. 2nd Edition, Springer-Verlag, Berlin, 2000.
11. J. Erickson. New lower bounds for hopcroft's problem. Discrete and Computational Geometry, 16(4):389-418, 1996.
12. P. Gupta, R. Janardan, and M. Smid. Handbook of Data Structures and Applications, chapter 64, Computational geometry: generalized intersection searching, pages 64.1-64.17. CRC Press, 2005.
13. X. Huang and V.Y. Pan. Fast rectangular matrix multiplication and applications. J. Complexity, 14(2):257-299, 1998.
14. E. Kaltofen. An output-sensitive variant of the baby steps/giant steps determinant algorithm. In Proc. Internat. Sympos. Symbolic Algeb. Comput. (ISSAC '02), 2002, pages 138-144.
15. α). In Proc. 14th Annu. ACM-SIAM Sympos. Discrete Algo. (SODA '03), 2003, pages 709-716.
16. L. Lee. Fast context-free grammar parsing requires fast boolean matrix multiplication. J. ACM, 49(1):1-15, 2002.
17. J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157-182, 1993.
18. E. Mossel, R. O'Donnell, and R. A. Servedio. Learning functions of k relevant variables. J. Comput. Syst. Sci., 69(1):421-434, 2004.
19. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
20. R. Yuster and U. Zwick. Fast sparse matrix multiplication. In Proc. Europ. Sympos. Algorithms (ESA), pages 604-615, 2004.
21. R. Yuster and U. Zwick. Answering distance queries in directed graphs using fast matrix multiplication. In Proc. 46th Annu. IEEE Sympos. Foundat. Comput. Sci. (FOCS '05), 2005, pages 389-396.