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:
“Whereas children can learn from their interactions with their parents how to get along in one sort of social hierarchy—that of the family—it is from their interactions with peers that they can best learn how to survive among equals in a wide range of social situations.”
—Zick Rubin (20th century)
“It is the essence of truth that it is never excessive. Why should it exaggerate? There is that which should be destroyed and that which should be simply illuminated and studied. How great is the force of benevolent and searching examination! We must not resort to the flame where only light is required.”
—Victor Hugo (1802–1885)