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:
“We must continually remind students in the classroom that expression of different opinions and dissenting ideas affirms the intellectual process. We should forcefully explain that our role is not to teach them to think as we do but rather to teach them, by example, the importance of taking a stance that is rooted in rigorous engagement with the full range of ideas about a topic.”
—bell hooks (b. 1955)
“Our graves that hide us from the searching sun
Are like drawn curtains when the play is done.
Thus march we, playing, to our latest rest,
Only, we die in earnest—that’s no jest.”
—Sir Walter Raleigh (1552?–1618)