Descripteur
Termes IGN > mathématiques > distance (mathématique) > distance euclidienne
distance euclidienneVoir aussi |
Documents disponibles dans cette catégorie (45)
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
Using landscape characteristics to define an adjusted distance metric for improving kriging interpolations / S. Lyon in International journal of geographical information science IJGIS, vol 24 n° 5-6 (may 2010)
[article]
Titre : Using landscape characteristics to define an adjusted distance metric for improving kriging interpolations Type de document : Article/Communication Auteurs : S. Lyon, Auteur ; R. Sorensen, Auteur ; J. Stendahl, Auteur ; J. Seibert, Auteur Année de publication : 2010 Article en page(s) : pp 723 - 740 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Statistiques
[Termes IGN] azote
[Termes IGN] carbone
[Termes IGN] distance euclidienne
[Termes IGN] humidité du sol
[Termes IGN] interpolation
[Termes IGN] krigeage
[Termes IGN] métrique
[Termes IGN] Suède
[Termes IGN] variogrammeRésumé : (Auteur) Interpolation of point measurements using geostatistical techniques such as kriging can be used to estimate values at non-sampled locations in space. Traditional geostatistics are based on the spatial autocorrelation concept that nearby things are more related than distant things. In this study, additional information was used to modify the traditional Euclidean concept of distance into an adjusted distance metric that incorporates similarity in terms of quantifiable landscape characteristics such as topography or land use. This new approach was tested by interpolating soil moisture content, pH and carbon-to-nitrogen (C:N) ratio measured in both the mineral and the organic soil layers at a field site in central Sweden. Semivariograms were created using both the traditional distance metrics and the proposed adjusted distance metrics to carry out ordinary kriging (OK) interpolations between sampling points. In addition, kriging with external drift (KED) was used to interpolate soil properties to evaluate the ability of the adjusted distance metric to incorporate secondary data into interpolations. The new adjusted distance metric typically lowered the nugget associated with the semivariogram, thereby better representing small-scale variability in the measured data compared to semivariograms based on the traditional distance metric. The pattern of the resulting kriging interpolations using KED and OK based on the adjusted distance metric were similar because they represented secondary data and, thus, enhanced small-scale variability compared to traditional distance OK. This created interpolations that agreed better with what is expected for the real-world spatial variation of the measured properties. Based on cross-validation error, OK interpolations using the adjusted distance metric better fit observed data than either OK interpolations using traditional distance or KED. Copyright Taylor & Francis Numéro de notice : A2010-168 Affiliation des auteurs : non IGN Thématique : MATHEMATIQUE Nature : Article DOI : 10.1080/13658810903062487 En ligne : https://doi.org/10.1080/13658810903062487 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30363
in International journal of geographical information science IJGIS > vol 24 n° 5-6 (may 2010) . - pp 723 - 740[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-2010032 RAB Revue Centre de documentation En réserve L003 Disponible 079-2010031 RAB Revue Centre de documentation En réserve L003 Disponible Efficient evaluation of continuous spatio-temporal queries on moving objects whith uncertain velocity / Y. Huang in Geoinformatica, vol 14 n° 2 (April 2010)
[article]
Titre : Efficient evaluation of continuous spatio-temporal queries on moving objects whith uncertain velocity Type de document : Article/Communication Auteurs : Y. Huang, Auteur ; C. Lee, Auteur Année de publication : 2010 Article en page(s) : pp 163 - 200 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] classification barycentrique
[Termes IGN] distance euclidienne
[Termes IGN] objet mobile
[Termes IGN] requête continue
[Termes IGN] requête spatiotemporelle
[Termes IGN] vitesseRésumé : (Auteur) Continuous Range (CR) query and Continuous K-Nearest Neighbor (CKNN) query are two important types of spatio-temporal queries. Given a time interval [ts , te ] and a moving query object q, a CR query is to find the moving objects whose Euclidean distances to q are within a user-given distance at each time instant within [ts , te ]. A CKNN query is to retrieve the K-Nearest Neighbors (KNNs) of this query object q at each time instant within [ts , te ]. In this paper, we investigate how to process these spatio-temporal queries efficiently under the situation that the velocity of each object is not fixed. This uncertainty on the velocity of object inevitably results in high complexity in processing spatio-temporal queries. We will discuss the complications incurred by this uncertainty and propose two algorithms, namely the Possibility-based possible within objects searching algorithm and the Possibility-based possible KNN searching algorithm, for the CR query and the CKNN query, respectively. A Possibility-based model is designed accordingly to quantify the possibility of each object being the result of a CR query or a CKNN query. Comprehensive experiments are performed to demonstrate the effectiveness and the efficiency of the proposed approaches. Copyright Springer Numéro de notice : A2010-064 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-009-0081-8 Date de publication en ligne : 23/04/2009 En ligne : https://doi.org/10.1007/s10707-009-0081-8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30260
in Geoinformatica > vol 14 n° 2 (April 2010) . - pp 163 - 200[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 057-2010021 RAB Revue Centre de documentation En réserve L003 Disponible A new algorithm for distance cartogram construction / E. Shimizu in International journal of geographical information science IJGIS, vol 23 n°11-12 (november 2009)
[article]
Titre : A new algorithm for distance cartogram construction Type de document : Article/Communication Auteurs : E. Shimizu, Auteur ; R. Inoue, Auteur Année de publication : 2009 Article en page(s) : pp 1453 - 1470 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] analyse spatio-temporelle
[Termes IGN] cartogramme
[Termes IGN] distance euclidienne
[Termes IGN] Japon
[Termes IGN] outil d'aide à la décision
[Termes IGN] réseau ferroviaire
[Termes IGN] villeRésumé : (Auteur) A distance cartogram is a diagram that visualizes the proximity indices between points in a network, such as time-distances between cities. The Euclidean distances between the points on the distance cartogram represent the given proximity indices. This is a useful visualization tool for the level of service of transport, e.g. difference in the level of service between regions or points in a network and its improvement in the course of time. The two previously proposed methods—multidimensional scaling (MDS) and network time-space mapping—have certain advantages and disadvantages. However, we observe that these methods are essentially the same, and the merits of both these methods can be combined to formulate a generalized solution. In this study, we first formulate the time-space mapping problem, which includes the key features of both of the above stated methods, and propose a generalized solution. We then apply this solution to the time-distances of Japan's railway networks to confirm its applicability. Copyright Taylor & Francis Numéro de notice : A2009-516 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810802186882 En ligne : https://doi.org/10.1080/13658810802186882 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30145
in International journal of geographical information science IJGIS > vol 23 n°11-12 (november 2009) . - pp 1453 - 1470[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-09071 RAB Revue Centre de documentation En réserve L003 Disponible 079-09072 RAB Revue Centre de documentation En réserve L003 Disponible The determination of potential difference by the joint application of measured and synthetical gravity data: a case study in Hungary / G. Papp in Journal of geodesy, vol 83 n° 6 (June 2009)
[article]
Titre : The determination of potential difference by the joint application of measured and synthetical gravity data: a case study in Hungary Type de document : Article/Communication Auteurs : G. Papp, Auteur ; E. Szeghy, Auteur ; J. Benedek, Auteur Année de publication : 2009 Article en page(s) : pp 509 - 521 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géodésie physique
[Termes IGN] anomalie de Bouguer
[Termes IGN] champ de pesanteur terrestre
[Termes IGN] distance euclidienne
[Termes IGN] Hongrie
[Termes IGN] levé gravimétrique
[Termes IGN] modèle numérique de terrain
[Termes IGN] nivellement
[Termes IGN] potentiel de pesanteur terrestreRésumé : (Auteur) In an elementary approach every geometrical height difference between the staff points of a levelling line should have a corresponding average g value for the determination of potential difference in the Earth’s gravity field. In practice this condition requires as many gravity data as the number of staff points if linear variation of g is assumed between them. Because of the expensive fieldwork, the necessary data should be supplied from different sources. This study proposes an alternative solution, which is proved at a test bed located in the Mecsek Mountains, Southwest Hungary, where a detailed gravity survey, as dense as the staff point density (~1 point/34 m), is available along a 4.3-km-long levelling line. In the first part of the paper the effect of point density of gravity data on the accuracy of potential difference is investigated. The average g value is simply derived from two neighbouring g measurements along the levelling line, which are incrementally decimated in the consecutive turns of processing. The results show that the error of the potential difference between the endpoints of the line exceeds 0.1 mm in terms of length unit if the sampling distance is greater than 2 km. Thereafter, a suitable method for the densification of the decimated g measurements is provided. It is based on forward gravity modelling utilising a high-resolution digital terrain model, the normal gravity and the complete Bouguer anomalies. The test shows that the error is only in the order of 10-3mm even if the sampling distance of g measurements is 4 km. As a component of the error sources of levelling, the ambiguity of the levelled height difference which is the Euclidean distance between the inclined equipotential surfaces is also investigated. Although its effect accumulated along the test line is almost zero, it reaches 0.15 mm in a 1-km-long intermediate section of the line. Copyright Springer Numéro de notice : A2009-284 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s00190-008-0257-2 En ligne : https://doi.org/10.1007/s00190-008-0257-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29914
in Journal of geodesy > vol 83 n° 6 (June 2009) . - pp 509 - 521[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 266-09051 SL Revue Centre de documentation Revues en salle Disponible Generalized network Voronoi diagrams: concepts, computational methods, and applications / Atsuyuki Okabe in International journal of geographical information science IJGIS, vol 22 n° 8-9 (august 2008)
[article]
Titre : Generalized network Voronoi diagrams: concepts, computational methods, and applications Type de document : Article/Communication Auteurs : Atsuyuki Okabe, Auteur ; T. Satoh, Auteur ; et al., Auteur Année de publication : 2008 Article en page(s) : pp 965 - 994 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] diagramme de Voronoï
[Termes IGN] distance euclidienne
[Termes IGN] distance pondérée
[Termes IGN] graphe planaire
[Termes IGN] milieu urbain
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] polygone
[Termes IGN] polyligne
[Termes IGN] système d'information géographiqueRésumé : (Auteur) In the real world, there are many phenomena that occur on a network or alongside a network; for example, traffic accidents on highways and retail stores along streets in an urbanized area. In the literature, these phenomena are analysed under the assumption that distance is measured with Euclidean distance on a plane. This paper first examines this assumption and shows an empirical finding that Euclidean distance is significantly different from the shortest path distance in an urbanized area if the distance is less than 500 m. This implies that service areas in urbanized areas cannot be well represented by Voronoi diagrams defined on a plane with Euclidean distance, termed generalized planar Voronoi diagrams. To overcome this limitation, second, this paper formulates six types of Voronoi diagrams defined on a network, termed generalized network Voronoi diagrams, whose generators are given by points, sets of points, lines and polygons embedded in a network, and whose distances are given by inward/outward distances, and additively/multiplicatively weighted shortest path distances. Third, in comparison with the generalized planar Voronoi diagrams, the paper empirically shows that the generalized network Voronoi diagrams can more precisely represent the service areas in urbanized areas than the corresponding planar Voronoi diagrams. Fourth, because the computational methods for constructing the generalized planar Voronoi diagrams in the literature cannot be applied to constructing the generalized network Voronoi diagrams, the paper provides newly developed efficient algorithms using the 'extended' shortest path trees. Last, the paper develops user-friendly tools (that are included in SANET, a toolbox for spatial analysis on a network) for executing these computational methods in a GIS environment. Copyright Taylor & Francis Numéro de notice : A2008-311 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810701587891 En ligne : https://doi.org/10.1080/13658810701587891 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29304
in International journal of geographical information science IJGIS > vol 22 n° 8-9 (august 2008) . - pp 965 - 994[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-08051 RAB Revue Centre de documentation En réserve L003 Disponible 079-08052 RAB Revue Centre de documentation En réserve L003 Disponible The effect of instructions on distance and similarity judgements in information spatializations / Sara Irina Fabrikant in International journal of geographical information science IJGIS, vol 22 n° 4-5 (april 2008)PermalinkAlgorithms for nearest neighbor search on moving object trajectories / E. Frentzos in Geoinformatica, vol 11 n° 2 (June - August 2007)PermalinkExtended Hausdorff distance for spatial objects in GIS / D. Min in International journal of geographical information science IJGIS, vol 21 n° 3-4 (march - april 2007)PermalinkQuery processing in spatial databases containing obstacles / Jun Zhang in International journal of geographical information science IJGIS, vol 19 n° 10 (november 2005)PermalinkCreating buffers on surfaces / X. Li in Cartography and Geographic Information Science, vol 32 n° 3 (July 2005)PermalinkDigital bathymetric models from rational profiles / R.M. Marin in Surveying and land information science, vol 64 n° 4 (01/12/2004)PermalinkClustering with obstacles for geographical data mining / V. Estivill-Castro in ISPRS Journal of photogrammetry and remote sensing, vol 59 n° 1-2 (August 2004 - April 2005)PermalinkA road network embedding technique for k-nearest neighbor search in moving object databases / M.R. Kolahdouzan in Geoinformatica, vol 7 n° 3 (September - November 2003)PermalinkHyperspectral edge filtering for measuring homogeneity of surface cover types / Wim H. Bakker in ISPRS Journal of photogrammetry and remote sensing, vol 56 n° 4 (July - August 2002)PermalinkPositionnement automatique des kilométrages / Jean-Michel Marrot (1994)Permalink