Descripteur
Termes IGN > géomatique > données localisées > données localisées numériques > données maillées
données mailléesSynonyme(s)Mode raster ;mode maillé Données rastréesVoir aussi |
Documents disponibles dans cette catégorie (197)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Optimal routefinding with unlimited possible directions of movement / Denis J. Dean in Transactions in GIS, vol 15 n° 1 (February 2011)
[article]
Titre : Optimal routefinding with unlimited possible directions of movement Type de document : Article/Communication Auteurs : Denis J. Dean, Auteur Année de publication : 2011 Article en page(s) : pp 87 - 107 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG
[Termes IGN] base de données localisées
[Termes IGN] calcul d'itinéraire
[Termes IGN] données maillées
[Termes IGN] recherche du chemin optimal, algorithme de
[Termes IGN] réseau routier
[Termes IGN] système d'information géographique
[Termes IGN] Triangular Regular NetworkRésumé : (Auteur) Finding optimal paths through raster databases is limited by the very nature of the raster data itself. This limitation restricts the possible directions of movement through the database from the infinite possibilities found in the real world to a finite number of possibilities defined by the cell-to-cell movement that characterizes raster databases. A Triangulated Irregular Network (TIN)-based alternative optimization model that allows unlimited possible directions of movement is presented. While not without its own limitations, this new approach offers a viable alternative to raster-based optimal routefinding. Numéro de notice : A2011-059 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/j.1467-9671.2010.01244.x Date de publication en ligne : 16/02/2011 En ligne : https://doi.org/10.1111/j.1467-9671.2010.01244.x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30840
in Transactions in GIS > vol 15 n° 1 (February 2011) . - pp 87 - 107[article]The OGC web coverage processing service (WCPS) standard / P. Baumann in Geoinformatica, vol 14 n° 4 (October 2010)
[article]
Titre : The OGC web coverage processing service (WCPS) standard Type de document : Article/Communication Auteurs : P. Baumann, Auteur Année de publication : 2010 Article en page(s) : pp 447 - 479 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web
[Termes IGN] données maillées
[Termes IGN] rastérisation
[Termes IGN] service web géographique
[Termes IGN] standard OGC
[Termes IGN] Web Coverage ServiceRésumé : (Auteur) Imagery is more and more becoming integral part of geo services. More generally, an increasing variety of sensors is generating massive amounts of data whose quantized nature frequently leads to rasterized data structures. Examples include 1-D time series, 2-D imagery, 3-D image time series and x/y/z spatial cubes, and 4-D x/y/z/t spatio-temporal cubes. The massive proliferation of such raster data through a rapidly growing number of services make open, standardized service interfaces increasingly important. Geo service standardization is undertaken by the Open GeoSpatial Consortium (OGC). The core raster service standard is the Web Coverage Service (WCS) which specifies retrieval based on subsetting, scaling, and reprojection. In 2008, OGC has issued a companion standard which adds flexible, open-ended coverage processing capabilities. This Web Coverage Processing Service (WCPS) specifies a coverage processing language allowing clients to send requests of arbitrary complexity for evaluation by the server. This contribution reports on the WCPS standard by giving an introduction to its coverage model and processing language. Further, design rationales are discussed, as well as background and relation to other OGC standards. 1-D to 4-D use case scenarios illustrate intended use and benefits for different communities. Although the paper focuses on conceptual issues, the WCPS reference implementation, PetaScope, is briefly addressed. The author is co-chair of the coverage-related working groups in OGC. Numéro de notice : A2010-304 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-009-0087-2 Date de publication en ligne : 15/07/2009 En ligne : https://doi.org/10.1007/s10707-009-0087-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30498
in Geoinformatica > vol 14 n° 4 (October 2010) . - pp 447 - 479[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2010041 RAB Revue Centre de documentation En réserve L003 Disponible An extension of GIS-based least-cost path modelling to the location of wide paths / Alexandre B. Goncalves in International journal of geographical information science IJGIS, vol 24 n°7-8 (july 2010)
[article]
Titre : An extension of GIS-based least-cost path modelling to the location of wide paths Type de document : Article/Communication Auteurs : Alexandre B. Goncalves, Auteur Année de publication : 2010 Article en page(s) : pp 983 - 996 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] chemin le moins coûteux, algorithme du
[Termes IGN] données maillées
[Termes IGN] itinéraireRésumé : (Auteur) The computation of least-cost paths over a cost surface is a well-known and widely used capability of raster geographic information systems (GISs). It consists in finding the path with the lowest accumulated cost between two locations in a raster model of a cost surface, which results in a string-like, thin and long sequence of cells. In this article, a new extension of raster-based least-cost path modelling is proposed. The new modelling approach allows the computation of paths or corridors with a fixed width, larger than one cell. These swaths are called wide paths and may be useful in circumstances where the detail level of the raster cost surfaces is higher than the width of the desired path or corridor. The wide path model presented in the article is independent of the choice of least-cost algorithms, because the transformation from regular to wide paths is applied to the construction of nodes and edges of an induced graph. The article gives the foundations and discusses the particularities of such paths, regardless of the imposed width, and explores the difference from the usual least-cost path model. Test cases were included, one hypothetical and the other with real data. The results are coherent and indicative of the applicability of wide paths. Numéro de notice : A2010-316 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810903401016 En ligne : https://doi.org/10.1080/13658810903401016 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30510
in International journal of geographical information science IJGIS > vol 24 n°7-8 (july 2010) . - pp 983 - 996[article]Réservation
Réserver ce documentExemplaires(2)
Code-barres Cote Support Localisation Section Disponibilité 079-2010041 RAB Revue Centre de documentation En réserve L003 Disponible 079-2010042 RAB Revue Centre de documentation En réserve L003 Disponible Multidimensional Map Algebra: design and implementation of a spatio-temporal GIS processing language / J. Mennis in Transactions in GIS, vol 14 n° 1 (February 2010)
[article]
Titre : Multidimensional Map Algebra: design and implementation of a spatio-temporal GIS processing language Type de document : Article/Communication Auteurs : J. Mennis, Auteur Année de publication : 2010 Article en page(s) : pp 1 - 21 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique
[Termes IGN] analyse de données
[Termes IGN] données localisées 3D
[Termes IGN] données maillées
[Termes IGN] données spatiotemporelles
[Termes IGN] implémentation (informatique)
[Termes IGN] Java (langage de programmation)
[Termes IGN] Map Algebra
[Termes IGN] modèle conceptuel de données
[Termes IGN] modélisation 4D
[Termes IGN] SIG temporelRésumé : (Auteur) Due to the increasing volume of spatio-temporal data generated from remote sensing, sensor networks and computational simulation, there is a need for a generic, domain-independent framework for spatio-temporal data analysis. This research presents a generic set of data processing and manipulation tools for spatio-temporal raster data called multidimensional map algebra (MMA). MMA is an extension of conventional map algebra that operates not only on data that are two-dimensional in space but also on data that are: (1) one-dimensional in time; (2) both two-dimensional in space and one-dimensional in time; (3) three-dimensional in space; and (4) both three-dimensional in space and one-dimensional in time. MMA data types, neighborhoods, lags, and functions are presented, including rules for combining data types of different dimensionality within local, focal, and zonal functions. A prototype implementation in JAVA is provided as a demonstration and syntax specification for the functions. Challenges to continued development of MMA include performance and efficiency issues for processing very large multidimensional data sets. Copyright Blackwell Publishing Numéro de notice : A2010-002 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/j.1467-9671.2009.01179.x Date de publication en ligne : 17/01/2010 En ligne : https://doi.org/10.1111/j.1467-9671.2009.01179.x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30198
in Transactions in GIS > vol 14 n° 1 (February 2010) . - pp 1 - 21[article]A network representation of raster land-cover patches / L. De Cola in Photogrammetric Engineering & Remote Sensing, PERS, vol 76 n° 1 (January 2010)
[article]
Titre : A network representation of raster land-cover patches Type de document : Article/Communication Auteurs : L. De Cola, Auteur Année de publication : 2010 Article en page(s) : pp 61 - 72 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] analyse comparative
[Termes IGN] autocorrélation spatiale
[Termes IGN] classification automatique
[Termes IGN] données maillées
[Termes IGN] structure de données localisées
[Termes IGN] système d'information géographiqueRésumé : (Auteur) Network models, based on mathematical graph theory, are used in many fields, from chemistry and biology to ecology and sociology. A nominal-valued land-cover raster can be represented as a network in which patches are nodes connected by links if two patches are adjacent. Built with existing GIS technology, the system is applied to the largest patches of a raster for the Washington, D.C. area in order to provide a data structure that visualizes the gross spatial structure of the raster; provides information about the overall arrangement of the patches and their adjacencies; and generates new metrics about land-cover patterns, connectivity and spatial autocorrelation. The system facilitates the evaluation of land-cover classifications, the measurement of landscape change, comparisons of data from different regions, and the analysis of land/environmental interactions. Copyright ASPRS Numéro de notice : A2010-014 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.14358/PERS.76.1.61 En ligne : https://doi.org/10.14358/PERS.76.1.61 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30210
in Photogrammetric Engineering & Remote Sensing, PERS > vol 76 n° 1 (January 2010) . - pp 61 - 72[article]Ant intelligence for solving optimal path-covering problems with multi-objectives / X. Li in International journal of geographical information science IJGIS, vol 23 n° 7-8 (july 2009)PermalinkAutomatic and accurate extraction of road intersections from raster maps / Yao-Yi Chiang in Geoinformatica, vol 13 n° 2 (June 2009)PermalinkA graph cut optimization guided by 3D-features for surface height recovery / Nesrine Chehata in ISPRS Journal of photogrammetry and remote sensing, vol 64 n° 2 (March - April 2009)PermalinkHistorique de la géomatique et des Systèmes d'Information Géographique (SIG) / Paul Courbon in XYZ, n° 118 (mars - mai 2009)PermalinkA theoretical approach to the use of cyberinfrastructure in geographical analysis / Shaowen Wang in International journal of geographical information science IJGIS, vol 23 n° 1-2 (january 2009)PermalinkLength-preserving thinning algorithm for line extraction from land cover data / J. Choi in Cartographica, vol 43 n° 4 (December 2008)PermalinkAutomatically and accurately conflating raster maps with orthoimagery / C.C. Chen in Geoinformatica, vol 12 n° 3 (September - November 2008)PermalinkReconstitution de la géométrie d'un glacier disparu et modélisation des conséquences de sa disparition : exemple du glacier durancien lors du dernier maximum glaciaire / E. Cossart in Revue internationale de géomatique, vol 18 n° 1 (mars – mai 2008)PermalinkAnalyse spatiale des activités socio-économiques dans Londres et sa banlieue / Guillaume Olive (2008)PermalinkCapture de layers durant une session dans un globe virtuel / G. Mazabraud (2008)Permalink