Centre dedocumentation
scientifique

The "Incense Road" from Petra to Gaza: an analysis using GIS and Cost functions / Motti Zohar in International journal of geographical information science IJGIS, vol 34 n° 2 (February 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n° 2 (February 2020) . - pp 292 - 310 Titre : The "Incense Road" from Petra to Gaza: an analysis using GIS and Cost functions Type de document : Article/Communication Auteurs : Motti Zohar, Auteur ; Tali Erickson-Gini, Auteur Année de publication : 2020 Article en page(s) : pp 292 - 310 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes descripteurs IGN] Arabie [Termes descripteurs IGN] bassin méditerranéen [Termes descripteurs IGN] carte archéologique [Termes descripteurs IGN] carte numérique [Termes descripteurs IGN] chemin le moins coûteux (algorithme) [Termes descripteurs IGN] empreinte [Termes descripteurs IGN] histoire [Termes descripteurs IGN] image ALOS-PALSAR [Termes descripteurs IGN] modèle numérique de surface [Termes descripteurs IGN] Petra [Termes descripteurs IGN] reconstruction de route [Termes descripteurs IGN] ressources en eau [Termes descripteurs IGN] système d'information géographique Résumé : (auteur) As early as the fourth century BCE, the Nabateans established the Incense Road to facilitate the transport of aromatic substances (frankincense and myrrh) from the Arabian Peninsula to the Mediterranean basin. An important part of this road was the segment between Petra and Gaza. Although studied before, the accurate route of parts of this segment is still vague since evidence of Roman milestones are scarce and significant portions of the landscape have changed dramatically in modern times, essentially wiping out the tracks of ancient roads. In this study, we use Geographic Information Systems (GIS) and Least Cost Path (LCP) analyses for reconstructing the original path of the Incense Road as well as verifying the factors influencing its establishment. The implemented analyses support the archeological evidence of two travel phases between Petra and Oboda (Avdat): During the first phase the Nabateans used the Darb es-Sultan route; during the second phase, from the first century BCE onwards, they passed through the Ramon Crater. This is the first time such reconstruction is made in the southern Levant. It was found that slope degree and the distance to water resources are dominant factors in reconstructing the accurate path of the Incense Road. Numéro de notice : A2020-029 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : https://doi.org/10.1080/13658816.2019.1669795 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94482 [article]

A topographically preserved road‐network tile model and optimal routing method for virtual globes / Quanhua Dong in Transactions in GIS, vol 23 n° 2 (April 2019)  

Public [article]  inTransactions in GIS > vol 23 n° 2 (April 2019) . - pp 294 - 311 Titre : A topographically preserved road‐network tile model and optimal routing method for virtual globes Type de document : Article/Communication Auteurs : Quanhua Dong, Auteur ; Jing Chen, Auteur ; Tingting Liu, Auteur Année de publication : 2019 Article en page(s) : pp 294 - 311 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web [Termes descripteurs IGN] calcul d'itinéraire [Termes descripteurs IGN] chemin le plus court (algorithme) [Termes descripteurs IGN] globe virtuel [Termes descripteurs IGN] intégrité topologique [Termes descripteurs IGN] réseau routier Résumé : (Auteur) Virtual globes enable the combination of heterogeneous datasets for optimal routing analyses in transportation, environmental ecology, and construction engineering. In this study, considering the advantages of the hierarchical tiling structure and topography of virtual globes, we propose a tile‐based optimal routing method for large‐scale road networks in a virtual globe. This method designs a topographically preserved road‐network tile model by partitioning roads into tiles and constructs the road‐network pyramid from the bottom to the top. During construction, a TileArc is calculated and flagged as the shortest path in a tile. Based on the built road‐network pyramid carrying hierarchical TileArcs, a multi‐level and flexible shortest path query can be executed efficiently. The proposed method is implemented with large road networks with different road grades in a virtual globe. Experimental results verify its validity, efficiency, and exactness. Moreover, the length of the shortest path with surface distance is approximately 1.3 times longer than that with Euclidean distance. Numéro de notice : A2019-252 Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12520 date de publication en ligne : 13/01/2019 En ligne : https://doi.org/10.1111/tgis.12520 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93010 [article]

Point clouds for direct pedestrian pathfinding in urban environments / Jesus Balado in ISPRS Journal of photogrammetry and remote sensing, vol 148 (February 2019)  

Public [article]  inISPRS Journal of photogrammetry and remote sensing > vol 148 (February 2019) . - pp 184 - 196 Titre : Point clouds for direct pedestrian pathfinding in urban environments Type de document : Article/Communication Auteurs : Jesus Balado, Auteur ; Lucia Diaz-Vilarino, Auteur ; Pedro Arias, Auteur ; Henrique Lorenzo, Auteur Année de publication : 2019 Article en page(s) : pp 184 - 196 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes descripteurs IGN] accessibilité [Termes descripteurs IGN] chemin le plus court (algorithme) [Termes descripteurs IGN] détection de partie cachée [Termes descripteurs IGN] données localisées 3D [Termes descripteurs IGN] graphe [Termes descripteurs IGN] itinéraire piétionnier [Termes descripteurs IGN] milieu urbain [Termes descripteurs IGN] navigation pédestre [Termes descripteurs IGN] objet mobile [Termes descripteurs IGN] objet statique [Termes descripteurs IGN] semis de points Mots-clés libres : espace urbain navigable pour piéton Résumé : (Auteur) Pathfinding applications for the citizen in urban environments are usually designed from the perspective of a driver, not being effective for pedestrians. In addition, urban scenes have multiple elements that interfere with pedestrian routes and navigable space. In this paper, a methodology for the direct use of point clouds for pathfinding in urban environments is presented, solving the main limitations for this purpose: (a) the excessive number of points is reduced for transformation into nodes on the final graph, (b) urban static elements acting as permanent obstacles, such as furniture and trees, are delimited and differentiated from dynamic elements such as pedestrians, (c) occlusions on ground elements are corrected to enable a complete graph modelling, and (d) navigable space is delimited from free unobstructed space according to two motor skills (pedestrians without reduced mobility and wheelchairs). The methodology is tested into three different streets sampled as point clouds by mobile laser scanning (MLS) systems: an intersection of several streets with ground composed of sidewalks at different heights; an avenue with wide sidewalks, trees and cars parked on one side; and a street with a single-lane road and narrow sidewalks. By applying Dijkstra pathfinding algorithm to the resulting graphs, the correct viability of the generated routes has been verified based on a visual analysis of the generated routes on the point cloud and on the knowledge of the urban study area. The methodology enables the automatic generation of graphs representing the navigable urban space, on which safe and real routes for different motor skills can be calculated. Numéro de notice : A2019-074 Thématique : GEOMATIQUE/IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2019.01.004 date de publication en ligne : 15/01/2019 En ligne : https://doi.org/10.1016/j.isprsjprs.2019.01.004 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92161 [article]

Réservation

Réserver ce document

Exemplaires (3)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
081-2019021	SL	Revue	Centre de documentation	Revues en salle	Disponible
081-2019023	DEP-RECP	Revue	MATIS	Dépôt en unité	Exclu du prêt
081-2019022	DEP-RECF	Revue	Nancy	Dépôt en unité	Exclu du prêt

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 descripteurs IGN] calcul d'itinéraire [Termes descripteurs IGN] chemin le plus rapide (algorithme) [Termes descripteurs IGN] connexité (graphes) [Termes descripteurs IGN] multilatération [Termes descripteurs IGN] programmation linéaire [Termes descripteurs IGN] réseau ferroviaire [Termes descripteurs IGN] Suisse [Termes descripteurs IGN] temps de trajet [Termes descripteurs IGN] train [Termes descripteurs IGN] transport public [Termes descripteurs 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 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 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

Depth-based hand pose estimation : Methods, data, and challenges / James Steven Supančič in International journal of computer vision, vol 126 n° 11 (November 2018)  

Permalink

International benchmarking of terrestrial laser scanning approaches for forest inventories / Xinlian Liang in ISPRS Journal of photogrammetry and remote sensing, vol 144 (October 2018)  

Permalink

A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks / Shaohua Wang in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)  

Permalink

No-reference image quality assessment for image auto-denoising / Xiangfei Kong in International journal of computer vision, vol 126 n° 5 (May 2018)  

Permalink

Aggregate keyword nearest neighbor queries on road networks / Pengfei Zhang in Geoinformatica [en ligne], vol 22 n° 2 (April 2018)  

Permalink

The characteristics of asymmetric pedestrian behavior : A preliminary study using passive smartphone location data / Nick Malleson in Transactions in GIS, vol 22 n° 2 (April 2018)  

Permalink

Harmonic regression of Landsat time series for modeling attributes from national forest inventory data / Barry T. Wilson in ISPRS Journal of photogrammetry and remote sensing, vol 137 (March 2018)  

Permalink

Un inventaire forestier multisource pour la gestion des territoires / Dinesh Babu Irulappa Pillai Vijayakumar (2018) 

Permalink

Localisation par l'image en milieu urbain : application à la réalité augmentée / Antoine Fond (2018)  

Permalink

Social Distance metric: from coordinates to neighborhoods / Vagan Terziyan in International journal of geographical information science IJGIS, vol 31 n° 11-12 (November - December 2017)  

Permalink