Centre de documentation
scientifique

Dépouillements

Algorithms for nearest neighbor search on moving object trajectories / E. Frentzos in Geoinformatica, vol 11 n° 2 (June - August 2007)  

Public [article]  inGeoinformatica > vol 11 n° 2 (June - August 2007) . - pp 159 - 193 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 metrics Ré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 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-07021	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Efficient detection of patterns in 2D trajectories of moving points / J. Gudmundsson in Geoinformatica, vol 11 n° 2 (June - August 2007)  

Public [article]  inGeoinformatica > vol 11 n° 2 (June - August 2007) . - pp 195 - 215 Titre : Efficient detection of patterns in 2D trajectories of moving points Type de document : Article/Communication Auteurs : J. Gudmundsson, Auteur ; Marc Van Kreveld, Auteur ; B. Speckmann, Auteur Année de publication : 2007 Article en page(s) : pp 195 - 215 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] approximation [Termes IGN] base de données d'objets mobiles [Termes IGN] exploration de données géographiques [Termes IGN] géomètrie algorithmique [Termes IGN] objet mobile Résumé : (Auteur) Moving point object data can be analyzed through the discovery of patterns in trajectories. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock, leadership, convergence, and encounter, as defined by Laube et al., Finding REMO—detecting relative motion patterns in geospatial lifelines, 201–214, (2004). These patterns are large enough subgroups of the moving point objects that exhibit similar movement in the sense of direction, heading for the same location, and/or proximity. By the use of techniques from computational geometry, including approximation algorithms, we improve the running time bounds of existing algorithms to detect these patterns. Copyright Springer Numéro de notice : A2007-237 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-006-0002-z En ligne : https://doi.org/10.1007/s10707-006-0002-z Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28600 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-07021	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Contextualization of geospatial database semantics for Human-GIS Interaction / G. Cai in Geoinformatica, vol 11 n° 2 (June - August 2007)  

Public [article]  inGeoinformatica > vol 11 n° 2 (June - August 2007) . - pp 217 - 237 Titre : Contextualization of geospatial database semantics for Human-GIS Interaction Type de document : Article/Communication Auteurs : G. Cai, Auteur Année de publication : 2007 Article en page(s) : pp 217 - 237 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] données localisées [Termes IGN] information sémantique [Termes IGN] interaction homme-machine [Termes IGN] modèle sémantique de données [Termes IGN] ontologie [Termes IGN] prise en compte du contexte Résumé : (Auteur) Human interactions with geographical information are contextualized by problem-solving activities which endow meaning to geospatial data and processing. However, existing spatial data models have not taken this aspect of semantics into account. This paper extends spatial data semantics to include not only the contents and schemas, but also the contexts of their use. We specify such a semantic model in terms of three related components: activity-centric context representation, contextualized ontology space, and context mediated semantic exchange. Contextualization of spatial data semantics allows the same underlying data to take multiple semantic forms, and disambiguate spatial concepts based on localized contexts. We demonstrate how such a semantic model supports contextualized interpretation of vague spatial concepts during human–GIS interactions. We employ conversational dialogue as the mechanism to perform collaborative diagnosis of context and to coordinate sharing of meaning across agents and data sources. Copyright Springer Numéro de notice : A2007-238 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-006-0001-0 En ligne : https://doi.org/10.1007/s10707-006-0001-0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28601 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-07021	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Multi-level topological relations between spatial regions based upon topological invariants / Min Deng in Geoinformatica, vol 11 n° 2 (June - August 2007)  

Public [article]  inGeoinformatica > vol 11 n° 2 (June - August 2007) . - pp 239 - 267 Titre : Multi-level topological relations between spatial regions based upon topological invariants Type de document : Article/Communication Auteurs : Min Deng, Auteur ; T. Cheng, Auteur ; X. Chen, Auteur ; Z. Li, Auteur Année de publication : 2007 Article en page(s) : pp 239 - 267 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] invariant [Termes IGN] modèle topologique de données [Termes IGN] relation topologique [Termes IGN] requête spatiale [Termes IGN] voisinage (relation topologique) Résumé : (Auteur) Topological relations have played important roles in spatial query, analysis and reasoning. In a two-dimensional space (IR2), most existing topological models can distinguish the eight basic topological relations between two spatial regions. Due to the arbitrariness and complexity of topological relations between spatial regions, it is difficult for these models to describe the order property of transformations among the topological relations, which is important for detailed analysis of spatial relations. In order to overcome the insufficiency in existing models, a multi-level modeling approach is employed to describe all the necessary details of region–region relations based upon topological invariants. In this approach, a set of hierarchically topological invariants is defined based upon the boundary–boundary intersection set (BBIS) of two involved regions. These topological invariants are classified into three levels based upon spatial set concept proposed, which include content, dimension and separation number at the set level, the element type at the element level, and the sequence at the integrated level. Corresponding to these hierarchical invariants, multi-level formal models of topological relations between spatial regions are built. A practical example is provided to illustrate the use of the approach presented in this paper. Copyright Springer Numéro de notice : A2007-239 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-006-0004-x En ligne : https://doi.org/10.1007/s10707-006-0004-x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28602 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-07021	RAB	Revue	Centre de documentation	En réserve L003	Disponible

A schedule-based pathfinding algorithm for transit networks using Pattern First Search [PFS] / R. Huang in Geoinformatica, vol 11 n° 2 (June - August 2007)  

Public [article]  inGeoinformatica > vol 11 n° 2 (June - August 2007) . - pp 269 - 285 Titre : A schedule-based pathfinding algorithm for transit networks using Pattern First Search [PFS] Type de document : Article/Communication Auteurs : R. Huang, Auteur Année de publication : 2007 Article en page(s) : pp 269 - 285 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] chemin le plus rapide, algorithme du [Termes IGN] complexité [Termes IGN] données spatiotemporelles [Termes IGN] requête spatiale [Termes IGN] réseau de transport [Termes IGN] système d'information géographique Résumé : (Auteur) The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US. Copyright Springer Numéro de notice : A2007-240 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-006-0011-y En ligne : https://doi.org/10.1007/s10707-006-0011-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28603 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-07021	RAB	Revue	Centre de documentation	En réserve L003	Disponible