Verwandte Artikel zu Range Searching: Preprocessing, Latitude, Longitude,...
Range Searching: Preprocessing, Latitude, Longitude, Data Structure, Computational Geometry, Geographic Information System - Softcover
Suchergebnisse für Range Searching: Preprocessing, Latitude, Longitude,...
Foto des Verkäufers
Range Searching
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 96 pp. Englisch. Bestandsnummer des Verkäufers 9786131367496
Neu kaufen
EUR 34,00
EUR 23,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Range Searching : Preprocessing, Latitude, Longitude, Data Structure, Computational Geometry, Geographic Information System
Print-on-DemandAnbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Bestandsnummer des Verkäufers 9786131367496
Neu kaufen
EUR 35,89
EUR 60,81 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Range Searching | Preprocessing, Latitude, Longitude, Data Structure, Computational Geometry, Geographic Information System
Print-on-DemandAnbieter: preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Range Searching | Preprocessing, Latitude, Longitude, Data Structure, Computational Geometry, Geographic Information System | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131367496 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Bestandsnummer des Verkäufers 113298741
Neu kaufen
EUR 109,85
EUR 70,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 5 verfügbar
Foto des Verkäufers
Range Searching
Print-on-DemandAnbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In its mostgeneral form, the range searching problem consists of preprocessing aset S of objects, in order to determine which objects from S a queryobject, called a range, intersects. For example, S may be a set ofpoints corresponding to the coordinates of several cities, and we wantto find the cities within a certain latitude and longitude range.Therange searching problems and data structures are a fundamental topic ofcomputational geometry. The range searching problem finds applicationsnot only in areas that deal with processing geometrical data (likegeographical information systems (GIS), and CAD), but also in databases.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 96 pp. Englisch. Bestandsnummer des Verkäufers 9786131367496
Neu kaufen
EUR 136,00
EUR 60,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar