Librería:
Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 27 de febrero de 2001
Proceedings of the NATO Advanced Research Workshop on Mapping and Spatial Modelling for Navigation, held in Fano, Denmark, August 21-25, 1989 Editor(s): Pau, Louis- Francois. Series: NATO ASI Subseries F. Num Pages: 357 pages, 18 black & white tables, biography. BIC Classification: TRC; UMB; UYQ; UYT. Category: (P) Professional & Vocational. Dimension: 242 x 170 x 25. Weight in Grams: 635. . 2012. Softcover reprint of the original 1st ed. 1990. Paperback. . . . . N° de ref. del artículo V9783642842177
This proceedings of a NATO Advanced Research Workshop (ARW) presents latest interdisciplinary research results on spatial data structures, mapping systems, cartographic feature extraction from imagery, mobile robot navigation, and operational and researchneeds in mapping. The emphasis is on specific techniques for map production and use.
Reseña del editor: The successful implementation of applications in spatial reasoning requires paying attention to the representation of spatial data. In particular, an integrated and uniform treatment of different spatial features is necessary in order to enable the reasoning to proceed quickly. Currently, the most prevalent features are points, rectangles, lines, regions, surfaces, and volumes. As an example of a reasoning task consider a query of the form "find all cities with population in excess of 5,000 in wheat growing regions within 10 miles of the Mississippi River. " Note that this query is quite complex. It requires- processing a line map (for the river), creating a corridor or buffer (to find the area within 10 miles of the river), a region map (for the wheat), and a point map (for the cities). Spatial reasoning is eased by spatially sorting the data (i. e. , a spatial index). In this paper we show how hierarchical data structures can be used to facilitate this process. They are based on the principle of recursive decomposition (similar to divide and conquer methods). In essence, they are used primarily as devices to sort data of more than one dimension and different spatial types. The term quadtree is often used to describe this class of data structures. In this paper, we focus on recent developments in the use of quadtree methods. We concentrate primarily on region data. For a more extensive treatment of this subject, see [SameS4a, SameSSa, SameSSb, SameSSc, SameSga, SameSgbj.
Título: Mapping and Spatial Modelling for Navigation
Editorial: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Año de publicación: 2012
Encuadernación: Encuadernación de tapa blanda
Condición: New
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Proceedings of the NATO Advanced Research Workshop on Mapping and Spatial Modelling for Navigation, held in Fano, Denmark, August 21-25, 1989The successful implementation of applications in spatial reasoning requires paying attention to the representati. Nº de ref. del artículo: 5072039
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 19195756-n
Cantidad disponible: 15 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020237640
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Paperback. Condición: new. Paperback. The successful implementation of applications in spatial reasoning requires paying attention to the representation of spatial data. In particular, an integrated and uniform treatment of different spatial features is necessary in order to enable the reasoning to proceed quickly. Currently, the most prevalent features are points, rectangles, lines, regions, surfaces, and volumes. As an example of a reasoning task consider a query of the form "find all cities with population in excess of 5,000 in wheat growing regions within 10 miles of the Mississippi River. " Note that this query is quite complex. It requires- processing a line map (for the river), creating a corridor or buffer (to find the area within 10 miles of the river), a region map (for the wheat), and a point map (for the cities). Spatial reasoning is eased by spatially sorting the data (i. e. , a spatial index). In this paper we show how hierarchical data structures can be used to facilitate this process. They are based on the principle of recursive decomposition (similar to divide and conquer methods). In essence, they are used primarily as devices to sort data of more than one dimension and different spatial types. The term quadtree is often used to describe this class of data structures. In this paper, we focus on recent developments in the use of quadtree methods. We concentrate primarily on region data. For a more extensive treatment of this subject, see [SameS4a, SameSSa, SameSSb, SameSSc, SameSga, SameSgbj. The successful implementation of applications in spatial reasoning requires paying attention to the representation of spatial data. It requires- processing a line map (for the river), creating a corridor or buffer (to find the area within 10 miles of the river), a region map (for the wheat), and a point map (for the cities). Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9783642842177
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The successful implementation of applications in spatial reasoning requires paying attention to the representation of spatial data. In particular, an integrated and uniform treatment of different spatial features is necessary in order to enable the reasoning to proceed quickly. Currently, the most prevalent features are points, rectangles, lines, regions, surfaces, and volumes. As an example of a reasoning task consider a query of the form 'find all cities with population in excess of 5,000 in wheat growing regions within 10 miles of the Mississippi River. ' Note that this query is quite complex. It requires- processing a line map (for the river), creating a corridor or buffer (to find the area within 10 miles of the river), a region map (for the wheat), and a point map (for the cities). Spatial reasoning is eased by spatially sorting the data (i. e. , a spatial index). In this paper we show how hierarchical data structures can be used to facilitate this process. They are based on the principle of recursive decomposition (similar to divide and conquer methods). In essence, they are used primarily as devices to sort data of more than one dimension and different spatial types. The term quadtree is often used to describe this class of data structures. In this paper, we focus on recent developments in the use of quadtree methods. We concentrate primarily on region data. For a more extensive treatment of this subject, see [SameS4a, SameSSa, SameSSb, SameSSc, SameSga, SameSgbj. 372 pp. Englisch. Nº de ref. del artículo: 9783642842177
Cantidad disponible: 2 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The successful implementation of applications in spatial reasoning requires paying attention to the representation of spatial data. In particular, an integrated and uniform treatment of different spatial features is necessary in order to enable the reasoning to proceed quickly. Currently, the most prevalent features are points, rectangles, lines, regions, surfaces, and volumes. As an example of a reasoning task consider a query of the form 'find all cities with population in excess of 5,000 in wheat growing regions within 10 miles of the Mississippi River. ' Note that this query is quite complex. It requires- processing a line map (for the river), creating a corridor or buffer (to find the area within 10 miles of the river), a region map (for the wheat), and a point map (for the cities). Spatial reasoning is eased by spatially sorting the data (i. e. , a spatial index). In this paper we show how hierarchical data structures can be used to facilitate this process. They are based on the principle of recursive decomposition (similar to divide and conquer methods). In essence, they are used primarily as devices to sort data of more than one dimension and different spatial types. The term quadtree is often used to describe this class of data structures. In this paper, we focus on recent developments in the use of quadtree methods. We concentrate primarily on region data. For a more extensive treatment of this subject, see [SameS4a, SameSSa, SameSSb, SameSSc, SameSga, SameSgbj. Nº de ref. del artículo: 9783642842177
Cantidad disponible: 1 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The successful implementation of applications in spatial reasoning requires paying attention to the representation of spatial data. In particular, an integrated and uniform treatment of different spatial features is necessary in order to enable the reasoning to proceed quickly. Currently, the most prevalent features are points, rectangles, lines, regions, surfaces, and volumes. As an example of a reasoning task consider a query of the form 'find all cities with population in excess of 5,000 in wheat growing regions within 10 miles of the Mississippi River. ' Note that this query is quite complex. It requires- processing a line map (for the river), creating a corridor or buffer (to find the area within 10 miles of the river), a region map (for the wheat), and a point map (for the cities). Spatial reasoning is eased by spatially sorting the data (i. e. , a spatial index). In this paper we show how hierarchical data structures can be used to facilitate this process. They are based on the principle of recursive decomposition (similar to divide and conquer methods). In essence, they are used primarily as devices to sort data of more than one dimension and different spatial types. The term quadtree is often used to describe this class of data structures. In this paper, we focus on recent developments in the use of quadtree methods. We concentrate primarily on region data. For a more extensive treatment of this subject, see [SameS4a, SameSSa, SameSSb, SameSSc, SameSga, SameSgbj.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 372 pp. Englisch. Nº de ref. del artículo: 9783642842177
Cantidad disponible: 1 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783642842177_new
Cantidad disponible: Más de 20 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9783642842177
Cantidad disponible: Más de 20 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. viii + 357. Nº de ref. del artículo: 2654513049
Cantidad disponible: 4 disponibles