Geometric Range Searching and Its Relatives

  title={Geometric Range Searching and Its Relatives},
  author={Pankaj K. Agarwal and J. J. Erickson},
Handbook of Discrete and Computational Geometry About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cient algorithms nor nontrivial lower bounds were known for most range-searching problems. A series of papers by Haussler and Welzl [ ], Clarkson [ ], and Clarkson and Shor [ ] not only marked the beginning of a new chapter in geometric searching, but also revitalized computational geometry as a whole. Led by these and a… CONTINUE READING
Highly Influential
This paper has highly influenced 41 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.
Showing 1-10 of 355 extracted citations

External Memory Data Structures

ESA • 2001
View 9 Excerpts
Highly Influenced

Algorithms – ESA 2013

John C. Mitchell, Bernhard Steffen, +3 authors Switzerland Moni Naor
Lecture Notes in Computer Science • 2013
View 13 Excerpts
Highly Influenced

LATIN 2012: Theoretical Informatics

Lecture Notes in Computer Science • 2012
View 13 Excerpts
Highly Influenced

Tight lower bounds for halfspace range searching

Symposium on Computational Geometry • 2010
View 5 Excerpts
Highly Influenced

Non-orthogonal Range Searching : A Review Technical Report No . 2008-546

Yurai Núñez-Rodŕıguez
View 9 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 15 references


P. Bozanis, N. Ktsios
Makris and A. Tsakalidis, , unpublished manuscript • 1996

Space- lling Curves

H. Sagan


J. D. Foley
van Dam, S. K. Feiner and J. F. Hughes, ComputerGraphics: Principles and Practice, Addison-Wesley, Reading, MA • 1990

The Rapid Evaluation of Potential Fields in Particle Systems

L. Greengard

Algorithms in Combinatorial Geometry

EATCS Monographs in Theoretical Computer Science • 1987

Similar Papers

Loading similar papers…