Article

Free access

Lower bounds for off-line range searching

Author:

Bernard ChazelleAuthors Info & Claims

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Pages 733 - 740

https://doi.org/10.1145/225058.225291

Published: 29 May 1995 Publication History

PDF eReader

References

[1]

Alon, N., Spencer, J. The,Probabilistic Method, John Wiley & Sons, New York, 1992.

Google Scholar

[2]

Beck, J., Chen, W.W. L. Irregularities of distri-bution, Cambridge Tracts in Mathematics, 89, Cambridge univ. Press, Cambridge, 1987.

Google Scholar

[3]

Chazelle, B. Lower bounds on the complexity of polyto~ range searching, J. Amer. Math. Sot., 2 (1989), 637-666.

Crossref

Google Scholar

[4]

Chazelle, B. Lower bounds for orthogonal range searchzng: II. the arithmetic model, J. ACM, 37 (1990), 200-212 and 439-463.

Digital Library

Google Scholar

[5]

Chazelle, B. A spectral approach to lower bounds, Proc. 35th Ann. IEEE Symp. Foundat. ~Ci. (1994), 674-682.

Digital Library

Google Scholar

[6]

Chazelle, B. Computahonal geometry: A retro-spective, Proc. 26th Ann. ACM Symp. Theory Comput. (1994), 75-94.

Digital Library

Google Scholar

[7]

Chazelle, B., Rosenberg, B. Lower bounds on the complexity of simplex range reporting on a pointer machine, Proc. 19th ICALP, LNCS 623, Springer-Verlag (1992), 439-449.

Digital Library

Google Scholar

[8]

Edelsbrunner, H. Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.

Digital Library

Google Scholar

[9]

Erickson, J. New lower bounds for Hopcroft's problem, to appear in Proc. 1 lth Ann. ACM Symp. Comput. Geom., 1995.

Digital Library

Google Scholar

[10]

Fredman, M.L. A lower bound on the complezitg of orthogonal range queries, J. ACM, 28 (1981), 696-705.

Digital Library

Google Scholar

[11]

Fredman, M.L. Lower bounds on the complexity of some optimal data structures, SIAM J. Com-put., 10 (1981), 1-10.

Crossref

Google Scholar

[12]

Lancaster, P., Tismenetsky, M. The Theory of Matrices, 2nd cd., Academic Press, 1985.

Google Scholar

[13]

Matou~ek, J. Geometric range searching, Tech. Report B-93-o9, Free Univ. Berlin, 1993.

Google Scholar

[14]

Mehlhorn, K. Data Structures and Algorithms 3: Multidimensional Searching and Computa-tional Geometry, Springer-Verlag, Heidelberg, Germany, 1984.

Digital Library

Google Scholar

[15]

Morgenstern, J. Note on a lower bound of the linear complexity of the fast Fourier transform, J. ACM, 20 (1973), 305-306.

Digital Library

Google Scholar

[16]

Mulmuley, K. Computational Geometry: An Introduction Through Randomized Algorithms, Prentice-Hall, 1994.

Google Scholar

[17]

Roth, K.F. On irregularities of distribution, Mathematika, 1 (1954), 73-79.

Crossref

Google Scholar

[18]

Yao, A.C. On the complexity of maintaining partial sums, SIAM J. Comput., 14 (1985), 277- 288.

Digital Library

Google Scholar

[19]

Yaoj F.F. Computational Geometry, in: Algo-rithms and Complexity, Handbook of Theoreti-cal Computer Science, ed. J. van Leeuwen, Vol. A, Elsevier (1990), 343-389.

Digital Library

Google Scholar

Cited By

View all

Afshani PArge LLarsen KDey TWhitesides S(2012)Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine modelProceedings of the twenty-eighth annual symposium on Computational geometry10.1145/2261250.2261299(323-332)Online publication date: 17-Jun-2012
https://dl.acm.org/doi/10.1145/2261250.2261299
Larsen KNguyen HDey TWhitesides S(2012)Improved range searching lower boundsProceedings of the twenty-eighth annual symposium on Computational geometry10.1145/2261250.2261275(171-178)Online publication date: 17-Jun-2012
https://dl.acm.org/doi/10.1145/2261250.2261275
Chan TLarsen KPătraşcu MHurtado Fvan Kreveld M(2011)Orthogonal range searching on the RAM, revisitedProceedings of the twenty-seventh annual symposium on Computational geometry10.1145/1998196.1998198(1-10)Online publication date: 13-Jun-2011
https://dl.acm.org/doi/10.1145/1998196.1998198
Show More Cited By

Index Terms

Lower bounds for off-line range searching
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on matrices
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Design and analysis of algorithms

Recommendations

Tight lower bounds for halfspace range searching
SoCG '10: Proceedings of the twenty-sixth annual symposium on Computational geometry

We establish two new lower bounds for the halfspace range searching problem: Given a set of n points in ℜ^d, where each point is associated with a weight from a commutative semigroup, compute the semigroup sum of the weights of the points lying within ...
Improved range searching lower bounds
SoCG '12: Proceedings of the twenty-eighth annual symposium on Computational geometry

In this paper we present a number of improved lower bounds for range searching in the pointer machine and the group model. In the pointer machine, we prove lower bounds for the approximate simplex range reporting problem. In approximate simplex range ...
Tight Lower Bounds for Halfspace Range Searching

We establish two new lower bounds for the halfspace range searching problem: Given a set of n points in źd, where each point is associated with a weight from a commutative semigroup, compute the semigroup sum of the weights of the points lying within ...

Comments

Information & Contributors

Information

Published In

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

May 1995

776 pages

ISBN:0897917189

DOI:10.1145/225058

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 May 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC95

Sponsor:

SIGACT

STOC95: Symposium on Theory of Computing

May 29 - June 1, 1995

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
273
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)1

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Afshani PArge LLarsen KDey TWhitesides S(2012)Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine modelProceedings of the twenty-eighth annual symposium on Computational geometry10.1145/2261250.2261299(323-332)Online publication date: 17-Jun-2012
https://dl.acm.org/doi/10.1145/2261250.2261299
Larsen KNguyen HDey TWhitesides S(2012)Improved range searching lower boundsProceedings of the twenty-eighth annual symposium on Computational geometry10.1145/2261250.2261275(171-178)Online publication date: 17-Jun-2012
https://dl.acm.org/doi/10.1145/2261250.2261275
Chan TLarsen KPătraşcu MHurtado Fvan Kreveld M(2011)Orthogonal range searching on the RAM, revisitedProceedings of the twenty-seventh annual symposium on Computational geometry10.1145/1998196.1998198(1-10)Online publication date: 13-Jun-2011
https://dl.acm.org/doi/10.1145/1998196.1998198
Larsen K(2011)On Range Searching in the Group Model and Combinatorial DiscrepancyProceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science10.1109/FOCS.2011.14(542-549)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1109/FOCS.2011.14
Afshani PArge LLarsen KKirkpatrick DMitchell J(2010)Orthogonal range reportingProceedings of the twenty-sixth annual symposium on Computational geometry10.1145/1810959.1811001(240-246)Online publication date: 13-Jun-2010
https://dl.acm.org/doi/10.1145/1810959.1811001
Afshani PArge LLarsen K(2009)Orthogonal Range Reporting in Three and Higher DimensionsProceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science10.1109/FOCS.2009.58(149-158)Online publication date: 25-Oct-2009
https://dl.acm.org/doi/10.1109/FOCS.2009.58
Patrascu MJohnson DFeige U(2007)Lower bounds for 2-dimensional range countingProceedings of the thirty-ninth annual ACM symposium on Theory of computing10.1145/1250790.1250797(40-46)Online publication date: 11-Jun-2007
https://dl.acm.org/doi/10.1145/1250790.1250797
Pellegrini M(1997)On counting pairs of intersecting segments and off-line triangle range searchingAlgorithmica10.1007/BF0252367917:4(380-398)Online publication date: Apr-1997
https://doi.org/10.1007/BF02523679
Erickson J(1996)New lower bounds for Hopcroft's problemDiscrete & Computational Geometry10.1007/BF0271287516:4(389-418)Online publication date: 1-Apr-1996
https://dl.acm.org/doi/10.1007/BF02712875
Erickson JSnoeyink J(1995)New lower bounds for Hopcroft's problemProceedings of the eleventh annual symposium on Computational geometry10.1145/220279.220293(127-137)Online publication date: 1-Sep-1995
https://dl.acm.org/doi/10.1145/220279.220293

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Tight lower bounds for halfspace range searching

Improved range searching lower bounds

Tight Lower Bounds for Halfspace Range Searching

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Tight lower bounds for halfspace range searching

Improved range searching lower bounds

Tight Lower Bounds for Halfspace Range Searching

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations