Centre dedocumentation
scientifique

Identification of enclaves and exclaves by computation based on point-set topology / Xiaonan Wang in International journal of geographical information science IJGIS, vol 37 n° 2 (February 2023)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 37 n° 2 (February 2023) . - pp 307 - 338 Titre : Identification of enclaves and exclaves by computation based on point-set topology Type de document : Article/Communication Auteurs : Xiaonan Wang, Auteur Année de publication : 2023 Article en page(s) : pp 307 - 338 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] frontière [Termes IGN] géopolitique [Termes IGN] intersection spatiale [Termes IGN] partition de surface [Termes IGN] polygone [Termes IGN] relation topologique [Termes IGN] territoire [Termes IGN] topologie Résumé : (auteur) Enclaves and exclaves have special roles in geography and are of particular importance to fields such as (geo)politics and economy. However, enclaves and exclaves have not been defined with sufficient formality for automatic identification yet. To identify enclaves and exclaves more generally by computational means than current definitions existing in the literature, this article proposes expressive and generalized mathematical definitions of enclaves and exclaves based on point-set topology. A novel Boundary Extended 16-Intersection Model is developed in this article to identify enclaves, and 74 possible spatial configurations of enclaves are distinguished according to conditions of intersections for polygons in partitions and enclaves. The classic Dimensionally Extended 9-Intersection Model is employed to identify exclaves, and two possible spatial configurations of exclaves are distinguished according to conditions of intersections for polygons in partitions and exclaves. Applications of the proposed definitions are exemplified by the identification of enclaves and exclaves in prototypes and in the real world. Numéro de notice : A2023-102 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2022.2120995 Date de publication en ligne : 21/09/2022 En ligne : https://doi.org/10.1080/13658816.2022.2120995 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102428 [article]

Is the radial distance really a distance? An analysis of its properties and interest for the matching of polygon features / Yann Méneroux in International journal of geographical information science IJGIS, vol 37 n° 2 (February 2023)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 37 n° 2 (February 2023) . - 38 p. Titre : Is the radial distance really a distance? An analysis of its properties and interest for the matching of polygon features Type de document : Article/Communication Auteurs : Yann Méneroux , Auteur ; Ibrahim Maidaneh Abdi, Auteur ; Arnaud Le Guilcher , Auteur ; Ana-Maria Olteanu-Raimond , Auteur Année de publication : 2023 Projets : 3-projet - voir note / Article en page(s) : 38 p. Note générale : bibliographie This work was supported by the French National Mapping Agency: Institut National de l’Information Géographique et Forestière (IGN) and by the University of Djibouti Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] abaque [Termes IGN] algorithme de Douglas-Peucker [Termes IGN] appariement de formes [Termes IGN] bâtiment [Termes IGN] BD Topo [Termes IGN] distance [Termes IGN] généralisation [Termes IGN] géométrie analytique [Termes IGN] modèle analytique [Termes IGN] polygone [Termes IGN] propagation d'erreur [Termes IGN] transformation rapide de Fourier Résumé : (auteur) In this paper, we examine the properties of the radial distance which has been used as a tool to compare the shape of simple surfacic objects. We give a rigorous definition of the radial distance and derive its theoretical properties, and in particular under which conditions it satisfies the distance properties. We show how the computation of the radial distance can be implemented in practice and made faster by the use of an analytical formula and a Fast Fourier Transform. Finally, we conduct experiments to measure how the radial distance is impacted by perturbation and generalization and we give abacuses and thresholds to deduce when buildings are likely to be homologous or non-homologous given their radial distance. Numéro de notice : A2023-074 Affiliation des auteurs : UGE-LASTIG (2020- ) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2022.2123487 Date de publication en ligne : 23/09/2022 En ligne : https://doi.org/10.1080/13658816.2022.2123487 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101671 [article]

A hexagon-based method for polygon generalization using morphological operators / Lu Wang in International journal of geographical information science IJGIS, vol 37 n° 1 (January 2023)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 37 n° 1 (January 2023) Titre : A hexagon-based method for polygon generalization using morphological operators Type de document : Article/Communication Auteurs : Lu Wang, Auteur ; Tinghua Ai, Auteur ; Dirk Burghardt, Auteur ; Yilang Shen, Auteur ; Min Yang, Auteur Année de publication : 2023 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] données maillées [Termes IGN] généralisation cartographique automatisée [Termes IGN] morphologie mathématique [Termes IGN] polygone [Vedettes matières IGN] Généralisation Résumé : (auteur) Numerous methods based on square rasters have been proposed for polygon generalization. However, these methods ignore the inconsistent distance measurement among neighborhoods of squares, which may result in an imbalanced generalization in different directions. As an alternative raster, a hexagon has consistent connectivity and isotropic neighborhoods. This study proposed a hexagon-based method for polygon generalization using morphological operators. First, we defined three generalization operators: aggregation, elimination, and line simplification, based on hexagonal morphological operations. We then used corrective operations with selection, skeleton, and exaggeration to detect, classify, and correct the unreasonably reduced narrow parts of the polygons. To assess the effectiveness of the proposed method, we conducted experiments comparing the hexagonal raster to square raster and vector data. Unlike vector-based methods in which various algorithms simplified either areal objects or exterior boundaries, the hexagon-based method performed both simplifications simultaneously. Compared to the square-based method, the results of the hexagon-based method were more balanced in all neighborhood directions, matched better with the original polygons, and had smoother simplified boundaries. Moreover, it performed with shorter running time than the square-based method, where the minimal time difference was less than 1 min, and the maximal time difference reached more than 50 mins. Numéro de notice : A2023-071 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2022.2108036 Date de publication en ligne : 10/08/2022 En ligne : https://doi.org/10.1080/13658816.2022.2108036 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101387 [article]

Linear building pattern recognition in topographical maps combining convex polygon decomposition / Zhiwei Wei in Geocarto international, vol 38 n° inconnu ([01/01/2023])  

Public [article]  inGeocarto international > vol 38 n° inconnu [01/01/2023] Titre : Linear building pattern recognition in topographical maps combining convex polygon decomposition Type de document : Article/Communication Auteurs : Zhiwei Wei, Auteur ; Su Ding, Auteur ; Lu Cheng, Auteur ; et al., Auteur Année de publication : 2023 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] carte topographique [Termes IGN] construction [Termes IGN] décomposition [Termes IGN] détection du bâti [Termes IGN] forme linéaire [Termes IGN] généralisation cartographique automatisée [Termes IGN] Ordnance Survey (UK) [Termes IGN] polygone [Termes IGN] reconnaissance de formes Résumé : (auteur) Building patterns are crucial for urban form understanding, automated map generalization, and 3 D city model visualization. The existing studies have recognized various building patterns based on visual perception rules in which buildings are considered as a whole. However, some visually aware patterns may fail to be recognized with these approaches because human vision is also proved as a part-based system. This paper first proposed an approach for linear building pattern recognition combining convex polygon decomposition. Linear building patterns including collinear patterns and curvilinear patterns are defined according to the proximity, similarity, and continuity between buildings. Linear building patterns are then recognized by combining convex polygon decomposition, in which a building can be decomposed into sub-buildings for pattern recognition. A novel node concavity is developed based on polygon skeletons which is applicable for building polygons with holes or not in the building decomposition. And building’s orthogonal features are also considered in the building decomposition. Two datasets collected from Ordnance Survey (OS) were used in the experiments to verify the effectiveness of the proposed approach. The results indicate that our approach achieves 25.57% higher precision and 32.23% higher recall in collinear pattern recognition and 15.67% higher precision and 18.52% higher recall in curvilinear pattern recognition when compared to existing approaches. Recognition of other kinds of building patterns including T-shaped and C-shaped patterns combining convex polygon decomposition are also discussed in this approach. Numéro de notice : A2022-263 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/10106049.2022.2055794 Date de publication en ligne : 27/03/2022 En ligne : https://doi.org/10.1080/10106049.2022.2055794 Format de la ressource électronique : 27/03/2022 Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=100260 [article]

An automated approach for clipping geographic data before projection that maintains data integrity and minimizes distortion for virtually any projection method / Jim Graham in Cartographica, Vol 57 n° 4 (December 2022)  

Public [article]  inCartographica > Vol 57 n° 4 (December 2022) . - pp 257 - 269 Titre : An automated approach for clipping geographic data before projection that maintains data integrity and minimizes distortion for virtually any projection method Type de document : Article/Communication Auteurs : Jim Graham, Auteur Année de publication : 2022 Article en page(s) : pp 257 - 269 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Projections [Termes IGN] carroyage [Termes IGN] intégrité des données [Termes IGN] polygone [Termes IGN] projection [Termes IGN] Python (langage de programmation) Résumé : (auteur) Selecting a map projection is key to minimizing distortion and thus clear communication of spatial data and accurate spatial analysis. Methods exist for selecting projections based on the intended area of use but not for finding polygons that can be used to clip geographic data to ensure the data are projected correctly and within desired distortion limits. The projection methods available in the Proj library were examined to determine the nature of the errors and distortions they created based on global data and a wide variety of available settings. Approaches were then identified for each projection including simple bounding boxes and more complex clipping polygons. To make sure that errors were not introduced into the projected data, data integrity polygons (DIPs) were created by placing a grid of cells over the Earth and then finding a cell near the origin that was within the specified criteria. Adjacent cells were added to the DIPs that met the criteria until no additional cells could be added. The criteria included projected cell sides could not intersect with themselves or other cells, the order of the cell corners could not be reversed, and distortion within the cell had to be within specified limits. I found that up to two DIPs with a limit on length distortion of a factor of 4 provided a general solution for all but three projection methods. Limitations included the time to find DIPs at high resolution. Clipping polygons and visualizations of the results were made available on a website. Numéro de notice : A2022-923 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.3138/cart-2021-0015 Date de publication en ligne : 01/12/2022 En ligne : https://doi.org/10.3138/cart-2021-0015 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=102465 [article]

Reconstructing compact building models from point clouds using deep implicit fields / Zhaiyu Chen in ISPRS Journal of photogrammetry and remote sensing, vol 194 (December 2022)  

Permalink

An unsupervised framework for extracting multilane roads from OpenStreetMap / Kunkun Wu in International journal of geographical information science IJGIS, vol 36 n° 11 (November 2022)  

Permalink

A boundary-based ground-point filtering method for photogrammetric point-cloud data / Seyed Mohammad Ayazi in Photogrammetric Engineering & Remote Sensing, PERS, vol 88 n° 9 (September 2022)  

Permalink

Particle swarm optimization based water index (PSOWI) for mapping the water extents from satellite images / Mohammad Hossein Gamshadzaei in Geocarto international, vol 36 n° 20 ([01/12/2021])  

Permalink

Binary space partitioning visibility tree for polygonal and environment light rendering / Hiroki Okuno in The Visual Computer, vol 37 n° 9 - 11 (September 2021)  

Permalink

Structure-aware indoor scene reconstruction via two levels of abstraction / Hao Fang in ISPRS Journal of photogrammetry and remote sensing, vol 178 (August 2021)  

Permalink

Towards efficient indoor/outdoor registration using planar polygons / Rahima Djahel in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol V-2-2021 (July 2021)  

Permalink

Mining regional patterns of land use with adaptive adjacent criteria / Xinmeng Tu in Cartography and Geographic Information Science, Vol 47 n° 5 (September 2020)  

Permalink

Planar polygons detection in lidar scans based on sensor topology enhanced Ransac / Stéphane Guinard in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, V-2 (August 2020)  

Permalink

Building detection and regularisation using DSM and imagery information / Yousif A. Mousa in Photogrammetric record, vol 34 n° 165 (March 2019)  

Permalink