In its most general form, the range searching problem 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, S may be a set of points corresponding to the coordinates of several cities, and we want to find the cities within a certain latitude and longitude range.
The range searching problems and data structures are a fundamental topic of computational geometry. The range searching problem finds applications not only in areas that deal with processing geometrical data (like geographical information systems (GIS), and CAD), but also in databases.
Read more about Range Searching: Variations, See Also
Famous quotes containing the words range and/or searching:
“In the range of things toddlers have to learn and endlessly review—why you can’t put bottles with certain labels in your mouth, why you have to sit on the potty, why you can’t take whatever you want in the store, why you don’t hit your friends—by the time we got to why you can’t drop your peas, well, I was dropping a few myself.”
—Mary Kay Blakely (20th century)
“Through searching out origins, one becomes a crab. The historian looks backwards, and finally he also believes backwards.”
—Friedrich Nietzsche (1844–1900)