|
[n° ou bulletin]
[n° ou bulletin]
|
Dépouillements


Multi‐temporal transport network models for accessibility studies / Diego Bogado Tomasiello in Transactions in GIS, vol 23 n° 2 (April 2019)
![]()
[article]
Titre : Multi‐temporal transport network models for accessibility studies Type de document : Article/Communication Auteurs : Diego Bogado Tomasiello, Auteur ; Mariana Giannotti, Auteur ; Renato Arbex, Auteur ; Clodoveu Davis, Auteur Année de publication : 2019 Article en page(s) : pp 203 - 223 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] accessibilité
[Termes IGN] granularité (informatique)
[Termes IGN] modèle conceptuel de données spatio-temporelles
[Termes IGN] modélisation spatio-temporelle
[Termes IGN] réseau de transport
[Termes IGN] Sao Paulo
[Termes IGN] urbanismeRésumé : (Auteur) Vehicle tracking is a spatio‐temporal source of high‐granularity travel time information that can be used for transportation planning. However, it is still a challenge to combine data from heterogeneous sources into a dynamic transport network, while allowing for network modifications over time. This article uses conceptual modeling to develop multi‐temporal transport networks in geographic information systems (GIS) for accessibility studies. The proposed multi‐temporal network enables accessibility studies with different temporal granularities and from any location inside the city, resulting in a flexible tool for transport and urban planning. The implemented network is tested in two case studies that focus on socially excluded people in a large global city, São Paulo, Brazil, including accessibility analyses from slum areas. It explores variations within a day and differences between transport modes across time. Case study results indicate how the accessibility is heterogeneous in low‐income regions. Numéro de notice : A2019-249 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12513 Date de publication en ligne : 10/03/2019 En ligne : https://doi.org/10.1111/tgis.12513 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93005
in Transactions in GIS > vol 23 n° 2 (April 2019) . - pp 203 - 223[article]Multilane roads extracted from the OpenStreetMap urban road network using random forests / Yongyang Xu in Transactions in GIS, vol 23 n° 2 (April 2019)
![]()
[article]
Titre : Multilane roads extracted from the OpenStreetMap urban road network using random forests Type de document : Article/Communication Auteurs : Yongyang Xu, Auteur ; Zhong Xie, Auteur ; Liang Wu, Auteur ; Zhanlong Chen, Auteur Année de publication : 2019 Article en page(s) : pp 224 - 240 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] apprentissage automatique
[Termes IGN] classification par forêts d'arbres décisionnels
[Termes IGN] données localisées des bénévoles
[Termes IGN] extraction du réseau routier
[Termes IGN] milieu urbain
[Termes IGN] OpenStreetMap
[Termes IGN] Pékin (Chine)
[Termes IGN] réseau routierRésumé : (Auteur) The volunteered geographic information (VGI) collected in OpenStreetMap (OSM) has been used in many applications. Extracting multilane roads and establishing a high level of expressed detail play important roles in the field of automated cartographic generalization. An accurate and detailed extraction process benefits geographic analysis, urban region division, and road network construction, as well as transportation applications services. The road networks in OSM have a high level of detail and complex structures; however, they also include many duplicate lines, which degrade the efficiency and increase the difficulty of extracting multilane roads. To resolve these problems, this work proposes a machine‐learning‐based approach, in which the road networks are first converted from lines to polygons. Then, various geometric descriptors, including compactness, width, circularity, area, perimeter, complexity, parallelism, shape descriptor, and width‐to‐length ratio, are used to train a random forest (RF) classifier and identify the candidates. Finally, another RF is trained to evaluate the candidates using all the geometric descriptors and topological features; the outputs of this second trained RF are the predicted multilane roads. An experiment using OSM data from Beijing, China validated the proposed method, which achieves a highly effective performance when extracting multilane roads from OSM. Numéro de notice : A2019-250 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12514 Date de publication en ligne : 26/12/2018 En ligne : https://doi.org/10.1111/tgis.12514 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93006
in Transactions in GIS > vol 23 n° 2 (April 2019) . - pp 224 - 240[article]An appearance‐preserving simplification method for complex 3D building models / Jiangfeng She in Transactions in GIS, vol 23 n° 2 (April 2019)
![]()
[article]
Titre : An appearance‐preserving simplification method for complex 3D building models Type de document : Article/Communication Auteurs : Jiangfeng She, Auteur ; Xiaoyan Gu, Auteur ; Junzhong Tan, Auteur ; et al., Auteur Année de publication : 2019 Article en page(s) : pp 275 - 293 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] modèle 3D de l'espace urbain
[Termes IGN] réduction (complexité)
[Termes IGN] rendu réaliste
[Termes IGN] SIG 3D
[Termes IGN] simplification de surface
[Termes IGN] texturage
[Vedettes matières IGN] GéovisualisationRésumé : (Auteur) The simplification of 3D building models to effectively reduce model complexity and improve rendering efficiency is an important component of 3D GIS. To reduce the data volume while preserving the model appearance, this article proposes a novel simplification method for complex 3D building models. Texture discontinuities are addressed by developing a new data model that records the mapping relation between the texture coordinates of each vertex and its neighboring triangles. The surface mesh of the building model is then segmented into regions, guided by topology and appearance. Finally, the mesh segmentation information is used to derive an improved error metric that considers both geometric and texture errors, and the texture coordinates are adjusted after each simplification operation. A series of comparative experiments alongside traditional methods demonstrates that our approach achieves a good balance between geometric fidelity and texture preservation, and produces simplified 3D building models with better visual quality. Numéro de notice : A2019-251 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12518 Date de publication en ligne : 05/02/2019 En ligne : https://doi.org/10.1111/tgis.12518 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=93007
in Transactions in GIS > vol 23 n° 2 (April 2019) . - pp 275 - 293[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)
![]()
[article]
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 IGN] calcul d'itinéraire
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] globe virtuel
[Termes IGN] intégrité topologique
[Termes IGN] réseau routierRé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 Affiliation des auteurs : non IGN 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
in Transactions in GIS > vol 23 n° 2 (April 2019) . - pp 294 - 311[article]