Geometric Range Searching and Its Relatives

Geometric Range Searching and Its Relatives

Cached

Download Links

by Pankaj K. Agarwal

Venue:	CONTEMPORARY MATHEMATICS
Citations:	222 - 35 self

BibTeX

@MISC{Agarwal_geometricrange,
    author = {Pankaj K. Agarwal},
    title = {Geometric Range Searching and Its Relatives},
    year = {}
}

Bookmark

OpenURL

Abstract

... process a set S of points in so that the points of S lying inside a query R region can be reported or counted quickly. Wesurvey the known techniques and data structures for range searching and describe their application to other related searching problems.

Citations

2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
911	Multidimensional binary search trees used for associative searching - Bentley - 1975
907	Computer Graphics: Principles and Practice - Foley, Dam, et al. - 1990
634	An optimal algorithm for approximate nearest neighbor searching fixed dimensions - Arya, Mount, et al. - 1998
630	Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals - Gray, Bosworth, et al. - 1996
372	Fast subsequence matching in time-series databases - Faloutsos, Ranganathan, et al. - 1994
368	ªFastmap: A Fast Algorithm for Indexing, Data-Mining and - Faloutsos, Lin - 1995
357	Applications of random sampling in computational geometry - Shor - 1989
296	The Rapid Evaluation of Potential Fields in Particle Systems - Greengard - 1988
288	On visible surface generation by a priori tree structures - Fuchs, Kedem, et al. - 1980
249	A weighted nearest neighbor algorithm for learning with symbolic features - Cost, Salzberg - 1993
208	Quad trees, a data structure for retrieval on composite keys - Finkel, Bentley - 1974
187	A combinatorial problem in geometry - Erdős, Szekeres - 1935
177	A cost model for nearest neighbor search in high-dimensional data space - Berchtold, Böhm, et al. - 1997
144	The buffer tree: A new technique for optimal I/O algorithms - Arge - 1995
142	Fractional cascading: I. A data structuring technique - Chazelle, Guibas - 1986
135	Surpassing the information theoretic bound with fusion trees - Fredman, Willard - 1993
131	FractaJs for secondary key retrieval - Faloutsos, Roseman - 1989
121	Ray shooting and parametric search - Agarwal, Matouˇsek - 1993
121	A functional approach to data structures and its use in multidimensional searching - Chazelle - 1988
104	Multidimensional divide-and-conquer - Bentley - 1980
104	A randomized algorithm for closest-point queries - Clarkson - 1988
99	Nearest neighbor queries in metric spaces - Clarkson - 1999
98	Filtering search: a new approach to query-answering - Chazelle - 1986
97	Decomposable searching problems I: Static-to-dynamic transformation - Bentley, Saxe - 1980
96	A deterministic view of random sampling and its use in geometry, Combinatorica 10 - Chazelle, Friedman - 1990
95	Computational learning theory - Anthony, Biggs - 1992
88	Applications of parametric searching in geometric optimization - Toledo, Agarwal, et al. - 1994
88	Ray shooting in polygons using geodesic triangulations - Chazelle, Edelsbrunner, et al. - 1994
83	Approximate nearest neighbor queries in fixed dimensions - Arya, Mount - 1993
82	The power of geometric duality - Chazelle, Guibas, et al. - 1983
80	A linear algorithm for determining the separation of convex polyhedra - Dobkin, Kirkpatrick - 1985
79	Approximate range searching - Arya, Mount
74	Visibility and intersection problems in plane geometry - Chazelle, Guibas - 1985
69	An algorithm for approximate closest-point queries - Clarkson - 1994
67	Quasi-optimal upper bounds for simplex range searching and new zone theorems - Chazelle, Sharir, et al. - 1992
61	An Implementation and Performance Analysis of Spatial Data Access Methods - Greene - 1989
57	Fast parallel similarity search in multimedia databases - BERCHTOLD, BHM, et al. - 1997
57	Lower bounds for orthogonal range searching, I: The reporting case - Chazelle - 1990
56	Efficient searching with linear constraints - Agarwal, Arge, et al.
53	Space–filling curves: Their generation and their application to bandwidth reduction - Bially - 1969
52	Strip trees: A hierarchical representation for curves - Ballard - 1981
45	Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications - Agarwal, Efrat, et al. - 1996
45	Geometric applications of a randomized optimization technique - Chan - 1999
44	Algebraic complexity theory, Grundlehren der mathematischen Wissenschaften, no. 315 - Bürgisser, Clausen, et al. - 1997
40	Computing envelopes in four dimensions with applications - Agarwal, Aronov, et al. - 1997
40	On Range Searching with Semialgebraic Sets. Discrete and Computational Geometry - Agarwal, Matouˇsek - 1994
40	Lower bounds for orthogonal range searching, II: The arithmetic model - Chazelle - 1990
39	Cutting hyperplanes for divide-and-conquer, Discrete Comput - Chazelle - 1993
38	Dynamic half-space range reporting and its applications - Agarwal, Matou˘sek - 1995