Descripteur
Documents disponibles dans cette catégorie (56)
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
Algorithms for nearest neighbor search on moving object trajectories / E. Frentzos in Geoinformatica, vol 11 n° 2 (June - August 2007)
[article]
Titre : Algorithms for nearest neighbor search on moving object trajectories Type de document : Article/Communication Auteurs : E. Frentzos, Auteur ; K. Gratsias, Auteur ; Nikos Pelekis, Auteur ; et al., Auteur Année de publication : 2007 Article en page(s) : pp 159 - 193 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] arbre-R
[Termes IGN] base de données d'objets mobiles
[Termes IGN] classification barycentrique
[Termes IGN] continuité géographique
[Termes IGN] distance euclidienne
[Termes IGN] objet mobile
[Termes IGN] objet statique
[Termes IGN] spatial metricsRésumé : (Auteur) Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far deals with either stationary or moving query points over static datasets or future (predicted) locations over a set of continuously moving points. With the increasing number of Mobile Location Services (MLS), the need for effective k-NN query processing over historical trajectory data has become the vehicle for data analysis, thus improving existing or even proposing new services. In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. The proposed (depth-first and best-first) algorithms vary with respect to the type of the query object (stationary or moving point) as well as the type of the query result (historical continuous or not), thus resulting in four types of NN queries. We also propose novel metrics to support our search ordering and pruning strategies. Using the implementation of the proposed algorithms on two members of the R-tree family for trajectory data (namely, the TB-tree and the 3D-R-tree), we demonstrate their scalability and efficiency through an extensive experimental study using large synthetic and real datasets. Copyright Springer Numéro de notice : A2007-236 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-006-0007-7 En ligne : https://doi.org/10.1007/s10707-006-0007-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28599
in Geoinformatica > vol 11 n° 2 (June - August 2007) . - pp 159 - 193[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 057-07021 RAB Revue Centre de documentation En réserve L003 Disponible Extended 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)
[article]
Titre : Extended Hausdorff distance for spatial objects in GIS Type de document : Article/Communication Auteurs : D. Min, Auteur ; L. Zhilin, Auteur ; C. Xiaoyong, Auteur Année de publication : 2007 Article en page(s) : pp 459 - 475 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] centroïde
[Termes IGN] distance de Hausdorff
[Termes IGN] distance euclidienne
[Termes IGN] fusion de données multisource
[Termes IGN] indicateur spatial
[Termes IGN] objet géographique
[Termes IGN] système d'information géographiqueRésumé : (Auteur) Distance is a fundamental concept in spatial sciences. Spatial distance is a very important parameter to measure the relative positions between spatial objects and to indicate the degree of similarity between neighbouring objects. Indeed, spatial distance plays an important role in many areas such as neighbourhood analysis, structural similarity measure, image (or object) matching, clustering analysis, and so on. In this paper, existing computational models for the distance between spatial objects are evaluated and their problems pointed out ; then, the concept of the Hausdorff distance is introduced as a metric indicator for different types of spatial objects. This distance is extended to a uniform representation by the introduction of the quantile, leading to the extended Hausdorff distance. Indeed, the so-called extended Hausdorff distance is, in fact, a kind of metric characterized by the minimum distance, the Hausdorff distance, and the median Hausdorff distance. The first two can be used for measuring the dispersion and the last one for measuring the central tendency of the distance distribution between spatial objects. A method termed the b.epsi-buffer has been proposed for the computation of the median Hausdorff distance. Finally, potential applications are discussed. Copyright Taylor & Francis Numéro de notice : A2007-121 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810601073315 En ligne : https://doi.org/10.1080/13658810601073315 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28484
in International journal of geographical information science IJGIS > vol 21 n° 3-4 (march - april 2007) . - pp 459 - 475[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-07021 RAB Revue Centre de documentation En réserve L003 Disponible 079-07022 RAB Revue Centre de documentation En réserve L003 Disponible Query processing in spatial databases containing obstacles / Jun Zhang in International journal of geographical information science IJGIS, vol 19 n° 10 (november 2005)
[article]
Titre : Query processing in spatial databases containing obstacles Type de document : Article/Communication Auteurs : Jun Zhang, Auteur ; Dimitris Papadias, Auteur ; et al., Auteur Année de publication : 2005 Article en page(s) : pp 1091 - 1111 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] appariement de graphes
[Termes IGN] arbre-R
[Termes IGN] barycentre
[Termes IGN] base de données localisées
[Termes IGN] distance euclidienne
[Termes IGN] jointure spatiale
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] relation topologique
[Termes IGN] requête spatialeRésumé : (Auteur) Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbours, e-distance joins, closest pairs and distance semi-joins, assuming that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed solutions is verified through extensive experiments. Numéro de notice : A2005-501 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810500286935 En ligne : https://doi.org/10.1080/13658810500286935 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27637
in International journal of geographical information science IJGIS > vol 19 n° 10 (november 2005) . - pp 1091 - 1111[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-05091 RAB Revue Centre de documentation En réserve L003 Disponible 079-05092 RAB Revue Centre de documentation En réserve L003 Disponible Creating buffers on surfaces / X. Li in Cartography and Geographic Information Science, vol 32 n° 3 (July 2005)
[article]
Titre : Creating buffers on surfaces Type de document : Article/Communication Auteurs : X. Li, Auteur ; C.L. Larson, Auteur ; A.B. Rex, Auteur Année de publication : 2005 Article en page(s) : pp 195 - 210 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] analyse spatiale
[Termes IGN] distance euclidienne
[Termes IGN] données maillées
[Termes IGN] données vectorielles
[Termes IGN] montagne
[Termes IGN] système d'information géographique
[Termes IGN] zone tamponRésumé : (Auteur) Creating buffers is an important function used in geographic information systems (GIS) to perform spatial analysis. However, delineating buffers for setbacks in conservation and planning applications is problematical in mountainous areas. A typical vector buffer function in GIS calculates two-dimensional (2D) Euclidean distance (i.e., planimetric distance) instead of surface (or slope) distance and results in an inaccurate representation of buffers when they are verified in the field. A method of delineating buffers on surfaces in the raster data model is presented in this paper. Ali efficient implementation of the method is achieved through the use of a min-heap and a hash-table based location index. The method is tested and analysed on both hypothetical and real surface datasets. Numéro de notice : A2005-419 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1559/1523040054738945 En ligne : https://doi.org/10.1559/1523040054738945 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27555
in Cartography and Geographic Information Science > vol 32 n° 3 (July 2005) . - pp 195 - 210[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 032-05031 RAB Revue Centre de documentation En réserve L003 Disponible Digital bathymetric models from rational profiles / R.M. Marin in Surveying and land information science, vol 64 n° 4 (01/12/2004)
[article]
Titre : Digital bathymetric models from rational profiles Type de document : Article/Communication Auteurs : R.M. Marin, Auteur ; T.E. Martin, Auteur Année de publication : 2004 Article en page(s) : pp 235 - 242 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Nivellement
[Termes IGN] classification barycentrique
[Termes IGN] distance euclidienne
[Termes IGN] image acoustique
[Termes IGN] jeu de données
[Termes IGN] modèle logique de données
[Termes IGN] modèle numérique bathymétrique
[Termes IGN] profil bathymétrique
[Termes IGN] sonar
[Termes IGN] triangulation de DelaunayRésumé : (Auteur) This paper presents a complete methodology for the reconstruction of a digital bathymetric model from a set of scattered data. Given a set of N scattered data representing the most significant points of a bathymetric surface that have been sampled in situ over a certain area or domain, the algorithms construct a triangulation of the domain using a minimal Euclidean distance criteria with the vertices of the triangulation and interpolated suface based on profiles obtained from the original scattered dataset. This bathymetric surface is obtained applying our methodology called "rational profiles" due to every profile being obtained from a grid which has been defined with a step as a relation of two integer numbers. The main contribution of this paper lies in two fields : the triangulation method and rational profile interpolation. We show an efficient algorithm based on a modified Delaunay triangulation called "Minimum Total Distance" (MTD), applicable locally or globally. We have also developed a new set of algorithms to generate a rational grid from the original large data set so as to produce the interpolation over the domain generating the final surface. By applying this methodology to many real samples, we have demonstrated that it is possible to achieve better running times with these new algorithms. This efficient realization of the algorithms uses adapted dynamic data structures and careful caching in an integrated framework. Numéro de notice : A2004-618 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27127
in Surveying and land information science > vol 64 n° 4 (01/12/2004) . - pp 235 - 242[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 121-04041 SL Revue Centre de documentation Revues en salle Disponible Clustering 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)PermalinkComparaison des éléments linéaires de deux bases de données géographiques, version 1.2 / Patrick Marmonier (2002)PermalinkA new merging process for data integration based on the Discrete Fréchet Distance / Thomas Devogele (2002)PermalinkPermalinkUsing distances for linear accuracy measurements / Thomas Devogele (2000)PermalinkGeometrical matching of polygons in GISs and assessment of geometrical quality of polygons / Atef Bel Hadj Ali (1999)PermalinkPositionnement automatique des kilométrages / Jean-Michel Marrot (1994)PermalinkJeux de distance et cartographie transformationnelle : le cas des Alpes maritimes / Andrée Dagorne in Bulletin du comité français de cartographie, n° 119 (mars - mai 1989)Permalink