Centre dedocumentation
scientifique

A space-time varying graph for modelling places and events in a network / Ikechukwu Maduako in International journal of geographical information science IJGIS, vol 33 n° 10 (October 2019)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 33 n° 10 (October 2019) . - pp 1915 - 1935 Titre : A space-time varying graph for modelling places and events in a network Type de document : Article/Communication Auteurs : Ikechukwu Maduako, Auteur ; Monica Wachowicz, Auteur Année de publication : 2019 Article en page(s) : pp 1915 - 1935 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] accident de la route [Termes descripteurs IGN] analyse des risques [Termes descripteurs IGN] analyse spatio-temporelle [Termes descripteurs IGN] connexité (graphes) [Termes descripteurs IGN] graphe [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] représentation spatiale [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] système d'information géographique [Termes descripteurs IGN] voisinage (topologie) Résumé : (auteur) Modelling topological relationships between places and events is challenging especially because these relationships are dynamic, and their evolutionary analysis relies on the explanatory power of representing their interactions across different temporal resolutions. In this paper, we introduce the Space-Time Varying Graph (STVG) based on the whole graph approach that combines directed and bipartite subgraphs with a time-tree for representing the complex interaction between places and events across time. We demonstrate how the proposed STVG can be exploited to identify and extract evolutionary patterns of traffic accidents using graph metrics, ad-hoc graph queries and clustering algorithms. The results reveal evolutionary patterns that uncover the places with high incidence of accidents over different time resolutions, reveal the main reasons why the traffic accidents have occurred, and disclose evolving communities of densely connected traffic accidents over time. Numéro de notice : A2019-393 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2019.1603386 date de publication en ligne : 17/04/2019 En ligne : https://doi.org/10.1080/13658816.2019.1603386 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93497 [article]

Computing and querying strict, approximate, and metrically refined topological relations in linked geographic data / Blake Regalia in Transactions in GIS, vol 23 n° 3 (June 2019)  

Public [article]  inTransactions in GIS > vol 23 n° 3 (June 2019) . - pp 601 - 619 Titre : Computing and querying strict, approximate, and metrically refined topological relations in linked geographic data Type de document : Article/Communication Auteurs : Blake Regalia, Auteur ; Krzysztof Janowicz, Auteur ; Grant McKenzie, Auteur Année de publication : 2019 Article en page(s) : pp 601 - 619 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes descripteurs IGN] DBpedia [Termes descripteurs IGN] données localisées [Termes descripteurs IGN] entité géographique [Termes descripteurs IGN] graphe [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] Web des données Résumé : (Auteur) Geographic entities and the information associated with them play a major role in Web‐scale knowledge graphs such as Linked Data. Interestingly, almost all major datasets represent places and even entire regions as point coordinates. There are two key reasons for this. First, complex geometries are difficult to store and query using the current Linked Data technology stack to a degree where many queries take minutes to return or will simply time out. Second, the absence of complex geometries confirms a common suspicion among GIScientists, namely that for many everyday queries place‐based relational knowledge is more relevant than raw geometries alone. To give an illustrative example, the statement that the White House is in Washington, DC is more important for gaining an understating of the city than the exact geometries of both entities. This does not imply that complex geometries are unimportant but that (topological) relations should also be extracted from them. As Egenhofer and Mark (1995b) put it in their landmark paper on naive geography, topology matters, metric refines. In this work we demonstrate how to compute and utilize strict, approximate, and metrically refined topological relations between several geographic feature types in DBpedia and compare our results to approaches that compute result sets for topological queries on the fly. Numéro de notice : A2019-256 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12548 date de publication en ligne : 26/06/2019 En ligne : https://doi.org/10.1111/tgis.12548 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93014 [article]

Query rewriting for semantic query optimization in spatial databases / Eduardo Mella in Geoinformatica [en ligne], vol 23 n° 1 (January 2019)  

Public [article]  inGeoinformatica [en ligne] > vol 23 n° 1 (January 2019) . - pp 79 - 104 Titre : Query rewriting for semantic query optimization in spatial databases Type de document : Article/Communication Auteurs : Eduardo Mella, Auteur ; M. Andrea Rodríguez, Auteur ; Loreto Bravo, Auteur ; Diego Gatica, Auteur Année de publication : 2019 Article en page(s) : pp 79 - 104 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes descripteurs IGN] contrainte d'intégrité [Termes descripteurs IGN] jointure spatiale [Termes descripteurs IGN] optimisation (mathématiques) [Termes descripteurs IGN] programmation par contraintes [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] requête (informatique) [Termes descripteurs IGN] requête spatiale [Termes descripteurs IGN] système de gestion de bases de données orientées objet Résumé : (auteur) Query processing is an important challenge for spatial databases due to the use of complex data types that represent spatial attributes. In particular, due to the cost of spatial joins, several optimization algorithms based on indexing structures exist. The work in this paper proposes a strategy for semantic query optimization of spatial join queries. The strategy detects queries with empty results and rewrites queries to eliminate unnecessary spatial joins or to replace spatial by thematic joins. This is done automatically by analyzing the semantics imposed by the database schema through topological dependencies and topological referential integrity constraints. In this way, the strategy comes to complement current state-of-art algorithms for processing spatial join queries. The experimental evaluation with real data sets shows that the optimization strategy can achieve a decrease in the time cost of a join query using indexing structures in a spatial database management system (SDBMS). Numéro de notice : A2019-224 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-018-00335-w date de publication en ligne : 04/01/2019 En ligne : http://dx.doi.org/10.1007/s10707-018-00335-w Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92623 [article]

Simultaneous chain-forming and generalization of road networks / Susanne Wenzel in Photogrammetric Engineering & Remote Sensing, PERS, vol 85 n° 1 (January 2019)  

Public [article]  inPhotogrammetric Engineering & Remote Sensing, PERS > vol 85 n° 1 (January 2019) . - pp 19 - 28 Titre : Simultaneous chain-forming and generalization of road networks Type de document : Article/Communication Auteurs : Susanne Wenzel, Auteur ; Dimitri Bulatov, Auteur Année de publication : 2019 Article en page(s) : pp 19 - 28 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] algorithme de Douglas-Peucker [Termes descripteurs IGN] analyse de groupement [Termes descripteurs IGN] axe médian [Termes descripteurs IGN] classification bayesienne [Termes descripteurs IGN] extraction du réseau routier [Termes descripteurs IGN] Graz [Termes descripteurs IGN] itération [Termes descripteurs IGN] mise à jour automatique [Termes descripteurs IGN] Munich [Termes descripteurs IGN] objet géographique linéaire [Termes descripteurs IGN] orthoimage [Termes descripteurs IGN] polyligne [Termes descripteurs IGN] primitive géométrique [Termes descripteurs IGN] relation topologique [Termes descripteurs IGN] réseau routier [Termes descripteurs IGN] segmentation sémantique [Termes descripteurs IGN] squelettisation [Termes descripteurs IGN] zone urbaine [Vedettes matières IGN] Généralisation Résumé : (auteur) Streets are essential entities of urban terrain and their automatic extraction from airborne sensor data is cumbersome because of a complex interplay of geometric, topological, and semantic aspects. Given a binary image representing the road class, centerlines of road segments are extracted by means of skeletonization. The focus of this paper lies in a well-reasoned representation of these segments by means of geometric primitives, such as straight line segments as well as circle and ellipse arcs. Thereby, we aim at a fusion of raw segments to longer chains which better match to the intuitive perception of what a street is. We propose a two-step approach for simultaneous chain-forming and generalization. First, we obtain an over-segmentation of the raw polylines. Then, a model selection approach is applied to decide whether two neighboring segments should be fused to a new geometric entity. For this purpose, we propose an iterative greedy optimization procedure in order to find a strong minimum of a cost function based on a Bayesian information criterion. Starting at the given initial raw segments, we thus can obtain a set of chains describing long alleys and important roundabouts. Within the procedure, topological attributes, such as junctions and neighborhood structures, are consistently updated, in a way that for the greedy optimization procedure, accuracy, model complexity, and topology are considered simultaneously. The results on two challenging datasets indicate the benefits of the proposed procedure and provide ideas for future work. Numéro de notice : A2019-026 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.14358/PERS.85.1.19 date de publication en ligne : 01/01/2019 En ligne : https://doi.org/10.14358/PERS.85.1.19 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91962 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
105-2019011	SL	Revue	Centre de documentation	Revues en salle	Disponible

An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model / Rosen Ivanov in International journal of geographical information science IJGIS, vol 32 n° 11-12 (November - December 2018)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 32 n° 11-12 (November - December 2018) . - pp 2362 - 2385 Titre : An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model Type de document : Article/Communication Auteurs : Rosen Ivanov, Auteur Année de publication : 2018 Article en page(s) : pp 2362 - 2385 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement [Termes descripteurs IGN] bati [Termes descripteurs IGN] calcul d'itinéraire [Termes descripteurs IGN] cartographie à la volée [Termes descripteurs IGN] chemin le plus court (algorithme) [Termes descripteurs IGN] connexité (graphes) [Termes descripteurs IGN] connexité (topologie) [Termes descripteurs IGN] modèle topologique de données [Termes descripteurs IGN] modélisation 3D du bâti BIM [Termes descripteurs IGN] positionnement en intérieur Résumé : (Auteur) This article presents an approach to computing K shortest paths in large buildings with complex horizontal and vertical connectivity. The building topology is obtained from Building Information Model (BIM) and implemented using directed multigraphs. Hierarchical design allows the calculation of feasible paths without the need to load into memory the topology of the entire building. It is possible to expand the graph with new connectivity on-the-fly. The paths calculated may be composed of traversable building components that are located inside the buildings or those that are both inside and outside buildings. The performance (computational time and heap size used) is optimized by using the appropriate collections (maps, lists and sets). The proposed algorithm is evaluated in several use-case scenarios – complete graphs and real building environments. In all test scenarios, the proposed path finding algorithm is faster and uses less memory when compared to the fast version of the Yen’s KSP algorithm. The proposed approach can be successfully used as a first level of coarse-to-fine path finding algorithms. Numéro de notice : A2018-525 Thématique : GEOMATIQUE/INFORMATIQUE/POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2018.1510126 date de publication en ligne : 24/08/2018 En ligne : https://doi.org/10.1080/13658816.2018.1510126 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91352 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2018061	SL	Revue	Centre de documentation	Revues en salle	Disponible

A topology-preserving polygon rasterization algorithm / Chen Zhou in Cartography and Geographic Information Science, Vol 45 n° 6 (November 2018)  

Permalink

Compactly representing massive terrain models as TINs in CityGML / Kavisha Kumar in Transactions in GIS, vol 22 n° 5 (October 2018)  

Permalink

Weighted simplicial complex reconstruction from mobile laser scanning using sensor topology / Stéphane Guinard in Revue Française de Photogrammétrie et de Télédétection, n° 217-218 (juin - septembre 2018)

Permalink

Classification of topological relations between spatial objects in two‐dimensional space within the dimensionally extended 9‐intersection model / Jingwei Shen in Transactions in GIS, vol 22 n° 2 (April 2018)  

Permalink

A spatio-temporal scenario model for emergency decision / Cheng Liu in Geoinformatica [en ligne], vol 22 n° 2 (April 2018)  

Permalink

Interpreting the fuzzy semantics of natural-language spatial relation terms with the fuzzy random forest algorithm / Xiaonan Wang in ISPRS International journal of geo-information, vol 7 n° 2 (February 2018)  

Permalink

Development of a Protocol to Convert and Manage Underground Infrastructure Maps into Geographic Information Systems (GIS) Format / Guillemette Fonteix (2018) 

Permalink

Object-based classification of terrestrial laser scanning point clouds for landslide monitoring / Andreas Mayr in Photogrammetric record, vol 32 n° 160 (December 2017)  

Permalink

Rule-guided human classification of Volunteered Geographic Information / Ahmed Loai Ali in ISPRS Journal of photogrammetry and remote sensing, vol 127 (May 2017)  

Permalink

A simplified linear feature matching method using decision tree analysis, weighted linear directional mean, and topological relationships / Ick-Hoi Kim in International journal of geographical information science IJGIS, vol 31 n° 5-6 (May-June 2017)  

Permalink