## Geometric Range Searching (1994)

### Cached

### Download Links

- [kam.mff.cuni.cz]
- [www2.parc.com]
- [www.cs.sunysb.edu]
- [www.cs.sunysb.edu]
- DBLP

### Other Repositories/Bibliography

by
Jiri Matousek

Citations: | 46 - 2 self |

### BibTeX

@MISC{Matousek94geometricrange,

author = {Jiri Matousek},

title = {Geometric Range Searching},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

In geometric range searching, algorithmic problems of the following type are considered: Given an n-point set P in the plane, build a data structure so that, given a query triangle R, the number of points of P lying in R can be determined quickly. Problems of this type are of crucial importance in computational geometry, as they can be used as subroutines in many seemingly unrelated algorithms. We present a survey of results and main techniques in this area.