Descripteur
Termes IGN > géomatique > infrastructure mondiale des données localisées > qualité des données > cohérence des données > intégrité des données > intégrité topologique
intégrité topologiqueSynonyme(s)cohérence topologique |
Documents disponibles dans cette catégorie (21)



Etendre la recherche sur niveau(x) vers le bas
Indoor mapping and modeling by parsing floor plan images / Yijie Wu in International journal of geographical information science IJGIS, vol 35 n° 6 (June 2021)
![]()
[article]
Titre : Indoor mapping and modeling by parsing floor plan images Type de document : Article/Communication Auteurs : Yijie Wu, Auteur ; Jianga Shang, Auteur ; Pan Chen, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 1205 - 1231 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] carte d'intérieur
[Termes IGN] chevauchement
[Termes IGN] CityGML
[Termes IGN] construction
[Termes IGN] format Industry foudation classes IFC
[Termes IGN] intégrité topologique
[Termes IGN] mur
[Termes IGN] optimisation spatiale
[Termes IGN] positionnement en intérieur
[Termes IGN] vectorisationRésumé : (auteur) A large proportion of indoor spatial data is generated by parsing floor plans. However, a mature and automatic solution for generating high-quality building elements (e.g., walls and doors) and space partitions (e.g., rooms) is still lacking. In this study, we present a two-stage approach to indoor mapping and modeling (IMM) from floor plan images. The first stage vectorizes the building elements on the floor plan images and the second stage repairs the topological inconsistencies between the building elements, separates indoor spaces, and generates indoor maps and models. To reduce the shape complexity of indoor boundary elements, i.e., walls and openings, we harness the regularity of the boundary elements and extract them as rectangles in the first stage. Furthermore, to resolve the overlaps and gaps of the vectorized results, we propose an optimization model that adjusts the rectangle vertex coordinates to conform to the topological constraints. Experiments demonstrate that our approach achieves a considerable improvement in room detection without conforming to Manhattan World Assumption. Our approach also outputs instance-separate walls with consistent topology, which enables direct modeling into Industry Foundation Classes (IFC) or City Geography Markup Language (CityGML). Numéro de notice : A2021-385 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1781130 Date de publication en ligne : 08/07/2020 En ligne : https://doi.org/10.1080/13658816.2020.1781130 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97642
in International journal of geographical information science IJGIS > vol 35 n° 6 (June 2021) . - pp 1205 - 1231[article]A probabilistic framework for improving reverse geocoding output / Zhengcong Yin in Transactions in GIS, Vol 24 n° 3 (June 2020)
![]()
[article]
Titre : A probabilistic framework for improving reverse geocoding output Type de document : Article/Communication Auteurs : Zhengcong Yin, Auteur ; Daniel W. Goldberg, Auteur ; Tracy A. Hammond, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 656 - 680 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] coordonnées GPS
[Termes IGN] géocodage inverse
[Termes IGN] géolocalisation
[Termes IGN] intégrité topologique
[Termes IGN] modèle stochastiqueRésumé : (auteur) Reverse geocoding, which transforms machine‐readable GPS coordinates into human‐readable location information, is widely used in a variety of location‐based services and analysis. The output quality of reverse geocoding is critical because it can greatly impact these services provided to end‐users. We argue that the output of reverse geocoding should be spatially close to and topologically correct with respect to the input coordinates, contain multiple suggestions ranked by a uniform standard, and incorporate GPS uncertainties. However, existing reverse geocoding systems often fail to fulfill these aims. To further improve the reverse geocoding process, we propose a probabilistic framework that includes: (1) a new workflow that can adapt all existing address models and unitizes distance and topology relations among retrieved reference data for candidate selections; (2) an advanced scoring mechanism that quantifies characteristics of the entire workflow and orders candidates according to their likelihood of being the best candidate; and (3) a novel algorithm that derives statistical surfaces for input GPS uncertainties and propagates such uncertainties into final output lists. The efficiency of the proposed approaches is demonstrated through comparisons to the four commercial reverse geocoding systems and through human judgments. We envision that more advanced reverse geocoding output ranking algorithms specific to different application scenarios can be built upon this work. Numéro de notice : A2020-444 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12623 Date de publication en ligne : 08/05/2020 En ligne : https://doi.org/10.1111/tgis.12623 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95507
in Transactions in GIS > Vol 24 n° 3 (June 2020) . - pp 656 - 680[article]Extending Processing Toolbox for assessing the logical consistency of OpenStreetMap data / Sukhjit Singh Sehra in Transactions in GIS, Vol 24 n° 1 (February 2020)
![]()
[article]
Titre : Extending Processing Toolbox for assessing the logical consistency of OpenStreetMap data Type de document : Article/Communication Auteurs : Sukhjit Singh Sehra, Auteur ; Jaiteg Singh, Auteur ; Hardeep Singh Rai, Auteur Année de publication : 2020 Article en page(s) : pp 44 - 71 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web
[Termes IGN] cartographie collaborative
[Termes IGN] données localisées
[Termes IGN] données localisées des bénévoles
[Termes IGN] données localisées libres
[Termes IGN] données routières
[Termes IGN] Inde
[Termes IGN] information sémantique
[Termes IGN] intégrité topologique
[Termes IGN] morphologie urbaine
[Termes IGN] OpenStreetMap
[Termes IGN] QGIS
[Termes IGN] qualité des donnéesRésumé : (auteur) OpenStreetMap (OSM) produces a huge amount of labeled spatial data, but its quality has always been a deep concern. Numerous quality issues have been discussed in the vast literature, while the fitness of OSM for road navigability is only partly explored. Navigability depends on logical consistency, which focuses on the existence of logical contradictions within a data set. Researchers have discussed the insufficiency of established methods and the lack of a computational paradigm to assess the quality of the OSM data. To address the research gaps, the current work extended the capabilities of the Quantum GIS Processing Toolbox for assessment of spatial data. The models and scripts developed are able to assess logical consistency based on geographical topological consistency, semantic information, and morphological consistency. The established and proxy indicators are selected for measuring the logical consistency of OSM data for navigability. For empirical validation, OSM Punjab data are compared with authoritative data from HERE (proprietary) and the Remote Sensing Centre (RSC), Punjab, India. The results conclude that even the proprietary road data sets are not free from logical inconsistencies and data contributed by the masses are credible and navigable. OSM has produced better results than the RSC, but needs more crowd contributions to improve its quality. Numéro de notice : A2020-101 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12587 Date de publication en ligne : 08/11/2019 En ligne : https://doi.org/10.1111/tgis.12587 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94692
in Transactions in GIS > Vol 24 n° 1 (February 2020) . - pp 44 - 71[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]An efficient visualization method for polygonal data with dynamic simplification / Mingguang Wu in ISPRS International journal of geo-information, vol 7 n° 4 (April 2018)
![]()
[article]
Titre : An efficient visualization method for polygonal data with dynamic simplification Type de document : Article/Communication Auteurs : Mingguang Wu, Auteur ; Taisheng Chen, Auteur ; Kun Zhang, Auteur ; Zhimin Jing, Auteur ; et al., Auteur Année de publication : 2018 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme de Douglas-Peucker
[Termes IGN] données localisées
[Termes IGN] intégrité topologique
[Termes IGN] maillage
[Termes IGN] OpenStreetMap
[Termes IGN] polygone
[Termes IGN] polyligne
[Termes IGN] simplification de contour
[Termes IGN] tessellation
[Termes IGN] visualisation de données
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) Polygonal data often require rendering with symbolization and simplification in geovisualization. A common issue in existing methods is that simplification, symbolization and rendering are addressed separately, causing computational and data redundancies that reduce efficiency, especially when handling large complex polygonal data. Here, we present an efficient polygonal data visualization method by organizing the simplification, tessellation and rendering operations into a single mesh generalization process. First, based on the sweep line method, we propose a topology embedded trapezoidal mesh data structure to organize the tessellated polygons. Second, we introduce horizontal and vertical generalization operations to simplify the trapezoidal meshes. Finally, we define a heuristic testing algorithm to efficiently preserve the topological consistency. The method is tested using three OpenStreetMap datasets and compared with the Douglas Peucker algorithm and the Binary Line Generalization tree-based method. The results show that the proposed method improves the rendering efficiency by a factor of six. Efficiency-sensitive mapping applications such as emergency mapping could benefit from this method, which would significantly improve their visualization performances. Numéro de notice : A2018-108 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/ijgi7040138 En ligne : https://doi.org/10.3390/ijgi7040138 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89537
in ISPRS International journal of geo-information > vol 7 n° 4 (April 2018)[article]A two-level topological model for 3D features in CityGML / Lin Li in Computers, Environment and Urban Systems, vol 59 (September 2016)
PermalinkRank-based strategies for cleaning inconsistent spatial databases / Nieves R. Brisaboa in International journal of geographical information science IJGIS, vol 29 n° 2 (February 2015)
PermalinkTopologically safe curved schematisation / Arthur Van Goethem in Cartographic journal (the), vol 50 n° 3 (August 2013)
PermalinkTopologically consistent 3D city models obtained by extrusion / Hugo Ledoux in International journal of geographical information science IJGIS, vol 25 n° 4-5 (May 2011)
PermalinkOCL for formal modelling of topological modelling constraints involving regions with broad boundaries / L. Bejaoui in Geoinformatica, vol 14 n° 3 (July 2010)
PermalinkSegmentation and reconstruction of polyhedral building roofs from aerial lidar points clouds / A. Sampath in IEEE Transactions on geoscience and remote sensing, vol 48 n° 3 Tome 2 (March 2010)
PermalinkConvergence analysis and quality criteria for an iterative schematization of networks / S. Avelar in Geoinformatica, vol 11 n° 4 (December 2007)
PermalinkCodage, adaptation et comparaison d'agorithmes de squelettisation d'une surface sur le SIG LAMPS2 / Christophe Mangeat (2005)
PermalinkDual grid: a new approach for robust spatial algebra implementation / J.A. Cotelo Lema in Geoinformatica, vol 6 n° 1 (March - May 2002)
PermalinkPermalink