22,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
11 °P sammeln
Andere Kunden interessierten sich auch für
![Range (mathematics)]( "Range (mathematics)")
Range (mathematics)22,99 €![Range (mathematics)]( "Range (mathematics)")
Range (mathematics)22,99 €![Medium Range Weather Forecast by Numerical Weather Prediction Model]( "Medium Range Weather Forecast by Numerical Weather Prediction Model")
Medium Range Weather Forecast by Numerical Weather Prediction Model44,99 €![Algorithm Design and Analysis]( "Algorithm Design and Analysis")
Algorithm Design and Analysis59,99 €![Long Range Interactions in Complex Networks]( "Long Range Interactions in Complex Networks")
Long Range Interactions in Complex Networks40,99 €![The Variance Gamma (VG) Model with Long Range Dependence]( "The Variance Gamma (VG) Model with Long Range Dependence")
The Variance Gamma (VG) Model with Long Range Dependence38,99 €![High Dynamic Range Image Reconstruction]( "High Dynamic Range Image Reconstruction")
High Dynamic Range Image Reconstruction29,95 €
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 a query object, called a range, intersects. 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.