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 IGN] accident de la route [Termes IGN] analyse des risques [Termes IGN] analyse spatio-temporelle [Termes IGN] connexité (graphes) [Termes IGN] graphe [Termes IGN] relation topologique [Termes IGN] représentation spatiale [Termes IGN] réseau routier [Termes IGN] système d'information géographique [Termes 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 Affiliation des auteurs : non IGN 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]

Sustainable development goals connectivity dilemma / Abbas Rajabifard (2019)  

Public Titre : Sustainable development goals connectivity dilemma : Land and geospatial information for urban and rural resilience Type de document : Monographie Auteurs : Abbas Rajabifard, Editeur scientifique Editeur : Boca Raton, New York, ... : CRC Press Année de publication : 2019 Importance : 376 p. Format : 16 x 24 cm ISBN/ISSN/EAN : 978-0-367-25935-8 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Infrastructure de données [Termes IGN] aménagement foncier [Termes IGN] approche holistique [Termes IGN] connexité (graphes) [Termes IGN] développement durable [Termes IGN] données localisées [Termes IGN] infrastructure mondiale des données localisées [Termes IGN] migration humaine [Termes IGN] résilience écologique [Termes IGN] système d'information géographique [Termes IGN] ville intelligente [Termes IGN] zone rurale [Termes IGN] zone urbaine Résumé : (éditeur) Large-scale migration from rural to urban areas, and between countries, affects sustainable development at local, national, and regional levels. To strengthen urban and rural resilience to global challenges, Sustainable Development Goals Connectivity Dilemma: Land and Geospatial Information for Urban and Rural Resilience, brings together leading international geospatial experts to analyze the role of land and geospatial data infrastructures and services for achieving the United Nations' Sustainable Development Goals (SDGs). While the goals outlined in the 2030 Agenda have been longstanding aspirations worldwide, the complexity and connectivity between social, economic, environmental, and governance challenges are changing with large-scale urbanization and population growth. Structured in 5 parts, the themes and objectives of the book are in line with the critical challenges, gaps, and opportunities raised at all UN-GGIM events and UN-GGIM Academic Network forums. Through the different perspectives of scholars, industry actors, and policy-makers, this book provides interdisciplinary analysis and multisectoral expertise on the interconnection between the SDGs, geospatial information, and urban and rural resilience. Sustainable Development Goals Connectivity Dilemma: Land and Geospatial Information for Urban and Rural Resilience is an essential reference for researchers, industry professionals, and postgraduate students in fields such as geomatics, land administration, urban planning, GIS, and sustainable development. It will also prove a vital resource for environmental protection specialists, government practitioners, UN-GGIM delegates, and geospatial and land administration agencies. Note de contenu : Part I- Setting the Scene Part II- Enhancing SDGs Connectivity and Disaster Resilience Part III- Supporting SDGs: Legal, Policies and Institutional Components and Capacity Building Part IV- Enabling Tools and Technical Components Part V- SDGs Perspectives: Current Practices and Case Studies Numéro de notice : 25852 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/URBANISME Nature : Monographie DOI : sans En ligne : https://www.taylorfrancis.com/books/e/9780429290626 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95443

Un algorithme pour battre le record du SwissTrainChallenge : poser le pied dans chacun des 26 cantons le plus rapidement possible en utilisant uniquement des transports publics / Emmanuel Cledat in XYZ, n° 157 (décembre 2018 - février 2019)

Public [article]  inXYZ > n° 157 (décembre 2018 - février 2019) . - pp 30 - 36 Titre : Un algorithme pour battre le record du SwissTrainChallenge : poser le pied dans chacun des 26 cantons le plus rapidement possible en utilisant uniquement des transports publics Type de document : Article/Communication Auteurs : Emmanuel Cledat, Auteur ; Dirk Lauinger, Auteur Année de publication : 2018 Article en page(s) : pp 30 - 36 Note générale : bibliographie Langues : Français (fre) Descripteur : [Vedettes matières IGN] Applications SIG [Termes IGN] calcul d'itinéraire [Termes IGN] chemin le plus rapide (algorithme) [Termes IGN] connexité (graphes) [Termes IGN] multilatération [Termes IGN] programmation linéaire [Termes IGN] réseau ferroviaire [Termes IGN] Suisse [Termes IGN] temps de trajet [Termes IGN] train [Termes IGN] transport public [Termes IGN] vitesse Résumé : (auteur) The Swiss Train Challenge is to set foot in all 26 cantons of Switzerland in as little time as possible, using only public transportation. Relying on human intuition informed by a geographical information system to select the relevant train stations, and on computational power to solve the resulting mixed-integer linear optimization problem, we find a solution that beats the current record of 17 hours and 19 minutes, by 25 minutes. When testing our itinerary in practice, we made all connections but one for which the arriving train was 20 minutes delayed - a rare event in switzerland. This is the first time that an algorithm has been used to calculate the Swiss Train Challenge itinerary. Numéro de notice : A2018-532 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91577 [article]

Réservation

Réserver ce document

Exemplaires (2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
112-2018041	SL	Revue	Centre de documentation	Revues en salle	Disponible
112-2018042	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 IGN] bati [Termes IGN] calcul d'itinéraire [Termes IGN] cartographie à la volée [Termes IGN] chemin le plus court (algorithme) [Termes IGN] connexité (graphes) [Termes IGN] connexité (topologie) [Termes IGN] modèle topologique de données [Termes IGN] modélisation 3D du bâti BIM [Termes 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 Affiliation des auteurs : non IGN 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	RAB	Revue	Centre de documentation	En réserve 3L	Disponible

Polygonal clustering analysis using multilevel graph-partition / Wanyi Wang in Transactions in GIS, vol 19 n° 5 (October 2015)  

Public [article]  inTransactions in GIS > vol 19 n° 5 (October 2015) . - pp 716 – 736 Titre : Polygonal clustering analysis using multilevel graph-partition Type de document : Article/Communication Auteurs : Wanyi Wang, Auteur ; Shihong Du, Auteur ; Zhou Guo, Auteur ; Liqun Luo, Auteur Année de publication : 2015 Article en page(s) : pp 716 – 736 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse comparative [Termes IGN] analyse de groupement [Termes IGN] connexité (graphes) [Termes IGN] distance [Termes IGN] données spatiotemporelles [Termes IGN] figure géométrique [Termes IGN] groupe [Termes IGN] partition des données [Termes IGN] polygone [Termes IGN] similitude Résumé : (auteur) Existing methods of spatial data clustering have focused on point data, whose similarity can be easily defined. Due to the complex shapes and alignments of polygons, the similarity between non-overlapping polygons is important to cluster polygons. This study attempts to present an efficient method to discover clustering patterns of polygons by incorporating spatial cognition principles and multilevel graph partition. Based on spatial cognition on spatial similarity of polygons, four new similarity criteria (i.e. the distance, connectivity, size and shape) are developed to measure the similarity between polygons, and used to visually distinguish those polygons belonging to the same clusters from those to different clusters. The clustering method with multilevel graph-partition first coarsens the graph of polygons at multiple levels, using the four defined similarities to find clusters with maximum similarity among polygons in the same clusters, then refines the obtained clusters by keeping minimum similarity between different clusters. The presented method is a general algorithm for discovering clustering patterns of polygons and can satisfy various demands by changing the weights of distance, connectivity, size and shape in spatial similarity. The presented method is tested by clustering residential areas and buildings, and the results demonstrate its usefulness and universality. Numéro de notice : A2015-684 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : http://dx.doi.org/10.1111/tgis.12124 Format de la ressource électronique : Url artticle Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=78325 [article]

2D arrangement-based hierarchical spatial partitioning: an application to pedestrian network generation / Murat Yirci (2013)  

Permalink

La modélisation des réseaux écologiques par les graphes paysagers : Méthodes et outils / Jean-Christophe Foltête in Revue internationale de géomatique, vol 22 n° 4 (décembre 2012 – février 2013)

Permalink

Connectivity in the regular polytope representation / R. Thompson in Geoinformatica, vol 15 n° 2 (April 2011)  

Permalink

Use Markov random fields for automatic cloud-shadow detection on high resolution / Sylvie Le Hégarat-Mascle in ISPRS Journal of photogrammetry and remote sensing, vol 64 n° 4 (July - August 2009)

Permalink

Qualitative spatial reasoning for high-resolution remote sensing image analysis / Jordi Inglada in IEEE Transactions on geoscience and remote sensing, vol 47 n° 2 (February 2009)

Permalink

Image-based quality assessment of road databases / M. Gerke in International journal of geographical information science IJGIS, vol 22 n° 8-9 (august 2008)

Permalink

Modélisation d'un réseau de mares et évaluation de la connectivité selon la théorie des graphes / A. Thulie in Géomatique expert, n° 41- 42 (01/03/2005)

Permalink

Géomatique / Stéphane Pelle (2005)

Permalink

Interprétation de cartes géographiques : algorithmes de reconstruction des réseaux hydrographiques et routiers / Robert Mariani in Traitement du signal, vol 14 n° 3 (01/06/1997)

Permalink

Interprétation de cartes géographiques : algorithmes de reconstruction des réseaux hydrographiques et routiers / Robert Mariani (1996)

Permalink