User:Pzoxicuvybtnrm/Sandbox 4
From Wikipedia, the free encyclopedia
In data structures, the range searching problem most generally consists of preprocessing a set S of objects, in order to determine which objects from S intersect with a query object, called a range. For example, if S is a set of points corresponding to the coordinates of several cities, a geometric variant of the problem is to find cities within a certain latitude and longitude range.
The range searching problem and the data structures that solve it are a fundamental topic of computational geometry. Applications of the problem arise in areas including geographical information systems (GIS) and computer-aided design (CAD), and databases.