Centre dedocumentation
scientifique

A comparison of neighbourhood relations based on ordinary Delaunay diagrams and area Delaunay diagrams: an application to define the neighbourhood relations of buildings / Hiroyuki Usui in International journal of geographical information science IJGIS, vol 34 n°11 (November 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n°11 (November 2020) . - pp 2177 - 2203 Titre : A comparison of neighbourhood relations based on ordinary Delaunay diagrams and area Delaunay diagrams: an application to define the neighbourhood relations of buildings Type de document : Article/Communication Auteurs : Hiroyuki Usui, Auteur ; Akihiro Teraki, Auteur ; Kei-ichi Okunuki, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : pp 2177 - 2203 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] adjacence [Termes descripteurs IGN] analyse de groupement [Termes descripteurs IGN] ArcGIS [Termes descripteurs IGN] bâtiment [Termes descripteurs IGN] chevauchement [Termes descripteurs IGN] diagramme de Voronoï [Termes descripteurs IGN] Tokyo (Japon) [Termes descripteurs IGN] triangulation de Delaunay [Termes descripteurs IGN] voisinage (topologie) Résumé : (auteur) The aim of this article is to describe a convenient but robust method for defining neighbourhood relations among buildings based on ordinary Delaunay diagrams (ODDs) and area Delaunay diagrams (ADDs). ODDs and ADDs are defined as a set of edges connecting the generators of adjacent ordinary Voronoi cells (points representing centroids of building polygons) and a set of edges connecting two centroids of building polygons, which are the generators of adjacent area Voronoi cells, respectively. Although ADDs are more robust than ODDs, computation time of ODDs is shorter than that of ADDs (the order of their computation time complexity is O(nlogn)). If ODDs can approximate ADDs with a certain degree of accuracy, the former can be used as an alternative. Therefore, we computed the ratio of the number of ADD edges to that of ODD edges overlapping ADDs at building and regional scales. The results indicate that: (1) for approximately 60% of all buildings, ODDs can exactly overlap ADDs with extra ODD edges; (2) at a regional scale, ODDs can overlap approximately 90% of ADDs with 10% extra ODD edges; and (3) focusing on judging errors, although ADDs are more accurate than ODDs, the difference is only approximately 1%. Numéro de notice : A2020-616 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2020.1748191 date de publication en ligne : 15/04/2020 En ligne : https://doi.org/10.1080/13658816.2020.1748191 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95991 [article]

Comparison of two methods for multiresolution terrain modelling in GIS / Turkay Gokgoz in Geocarto international, vol 35 n° 12 ([01/09/2020])  

Public [article]  inGeocarto international > vol 35 n° 12 [01/09/2020] . - pp 1360 - 1372 Titre : Comparison of two methods for multiresolution terrain modelling in GIS Type de document : Article/Communication Auteurs : Turkay Gokgoz, Auteur ; Müslüm Hacar, Auteur Année de publication : 2020 Article en page(s) : pp 1360 - 1372 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes descripteurs IGN] analyse comparative [Termes descripteurs IGN] analyse multirésolution [Termes descripteurs IGN] modèle numérique de surface [Termes descripteurs IGN] point remarquable [Termes descripteurs IGN] système d'information géographique [Termes descripteurs IGN] Triangulated Irregular Network [Termes descripteurs IGN] triangulation de Delaunay Résumé : (auteur) Very important points (VIPs) and important points and edges (IPEs) methods have been compared in accordance with the TINs obtained by: (1) Delaunay triangulation using DEM points determined by VIP and (2) constrained Delaunay triangulation using DEM points and triangle edges determined by IPE. It was ensured that the number of points in each TIN was approximately equal to the number calculated by Töpfer’s formula, and that the vertical error of each TIN was less than the error calculated by Koppe’s formula. According to the results, (1) both methods are quality prioritized, (2) IPE is more sensitive to local surface changes, (3) important triangle edges determined by IPE make a significant contribution to the TIN, (4) some of the points selected by IPE are more important points than that of VIP, and (5) IPE-based TINs are more structural fidelity than VIP-based TINs. Numéro de notice : A2020-485 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/10106049.2019.1573929 date de publication en ligne : 27/02/2019 En ligne : https://doi.org/10.1080/10106049.2019.1573929 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95652 [article]

Provably consistent distributed Delaunay triangulation / Mathieu Brédif in ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, V-2 (August 2020)  

Public [article]  inISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences > V-2 (August 2020) . - pp 195 - 202 Titre : Provably consistent distributed Delaunay triangulation Type de document : Article/Communication Auteurs : Mathieu Brédif , Auteur ; Laurent Caraffa , Auteur ; Murat Yirci, Auteur ; Pooran Memari, Auteur Congrès : Congrès: ISPRS 2020, virtual Congress Imaging today foreseeing tomorrow (31 aout - 2 septembre 2020; Nice, France) , Commanditaire Année de publication : 2020 Projets : IQmulus / Brédif, Mathieu Article en page(s) : pp 195 - 202 Note générale : bibliographie Dans HAL https://hal.archives-ouvertes.fr/hal-02551509 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie [Termes descripteurs IGN] données lidar [Termes descripteurs IGN] données localisées 3D [Termes descripteurs IGN] géomètrie algorithmique [Termes descripteurs IGN] informatique en nuage [Termes descripteurs IGN] semis de points [Termes descripteurs IGN] Spark [Termes descripteurs IGN] traitement de nuage de points [Termes descripteurs IGN] triangulation de Delaunay Résumé : (Auteur) This paper deals with the distributed computation of Delaunay triangulations of massive point sets, mainly motivated by the needs of a scalable out-of-core surface reconstruction workflow from massive urban LIDAR datasets. Such a data often corresponds to a huge point cloud represented through a set of tiles of relatively homogeneous point sizes. This will be the input of our algorithm which will naturally partition this data across multiple processing elements. The distributed computation and communication between processing elements is orchestrated efficiently through an uncentralized model to represent, manage and locally construct the triangulation corresponding to each tile. Initially inspired by the star splaying approach, we review the Tile\& Merge algorithm for computing Distributed Delaunay Triangulations on the cloud, provide a theoretical proof of correctness of this algorithm, and analyse the performance of our Spark implementation in terms of speedup and strong scaling in both synthetic and real use case datasets. A HPC implementation (e.g. using MPI), left for future work, would benefit from its more efficient message passing paradigm but lose the robustness and failure resilience of our Spark approach. Numéro de notice : A2020-410 Affiliation des auteurs : LaSTIG+Ext (2020- ) Thématique : IMAGERIE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.5194/isprs-annals-V-2-2020-195-2020 date de publication en ligne : 03/08/2020 En ligne : https://doi.org/10.5194/isprs-annals-V-2-2020-195-2020 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94979 [article]

Small‐area patch‐merging method accounting for both local constraints and the overall area balance / Chengming Li in Transactions in GIS, Vol 24 n° 4 (August 2020)  

Public [article]  inTransactions in GIS > Vol 24 n° 4 (August 2020) . - 21 p. Titre : Small‐area patch‐merging method accounting for both local constraints and the overall area balance Type de document : Article/Communication Auteurs : Chengming Li, Auteur ; Yong Yin, Auteur ; Zhaoxin Dai, Auteur Année de publication : 2020 Article en page(s) : 21 p. Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes descripteurs IGN] fusion (généralisation) [Termes descripteurs IGN] itération [Termes descripteurs IGN] Kouangtoung (Chine) [Termes descripteurs IGN] parcelle agricole [Termes descripteurs IGN] structure hiérarchique de données [Termes descripteurs IGN] superficie [Termes descripteurs IGN] Triangulated Irregular Network [Termes descripteurs IGN] triangulation de Delaunay [Termes descripteurs IGN] utilisation du sol [Vedettes matières IGN] Généralisation Résumé : (auteur) Small‐area patch merging is a common operation in land use data generalization. However, existing research on small‐area patch merging has mainly focused on local compatibility measures, which often lead to area imbalances among land use types from a global perspective. To address the shortcomings of previous studies by resolving local and global concerns simultaneously, this article proposes a merging method that considers both local constraints and the overall area balance. First, a local optimization model that considers three constraints—namely, the areas of neighboring patches, the lengths of shared arcs, and semantic similarity—is established. The areas of small patches are first pre‐allocated. Subsequently, in accordance with an area change threshold for individual land use types, land use types with area changes that exceed this threshold are identified. The patches corresponding to these land use types are subjected to iterative adjustments while considering the overall area balance. Based on their area splitting abilities, the split lines for small‐area patches are determined, and small‐area patches are merged. Finally, actual data from Guangdong Province are used for validation. The experimental results demonstrate that the proposed method is capable of preserving the local compatibility of patches while balancing the overall area associated with each land use type. Numéro de notice : A2020-672 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12634 date de publication en ligne : 29/05/2020 En ligne : https://doi.org/10.1111/tgis.12634 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96157 [article]

Recognizing linear building patterns in topographic data by using two new indices based on Delaunay triangulation / Xianjin He in ISPRS International journal of geo-information, vol 9 n° 4 (April 2020)  

Public [article]  inISPRS International journal of geo-information > vol 9 n° 4 (April 2020) . - 14 p. Titre : Recognizing linear building patterns in topographic data by using two new indices based on Delaunay triangulation Type de document : Article/Communication Auteurs : Xianjin He, Auteur ; Min Deng, Auteur Année de publication : 2020 Article en page(s) : 14 p. Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes descripteurs IGN] adjacence [Termes descripteurs IGN] direction [Termes descripteurs IGN] discontinuité [Termes descripteurs IGN] données topographiques [Termes descripteurs IGN] modèle linéaire [Termes descripteurs IGN] modèle numérique du bâti [Termes descripteurs IGN] reconnaissance de formes [Termes descripteurs IGN] segmentation [Termes descripteurs IGN] triangulation de Delaunay [Termes descripteurs IGN] voisinage (topologie) Résumé : (auteur) Building pattern recognition is fundamental to a wide range of downstream applications, such as urban landscape evaluation, social analyses, and map generalization. Although many studies have been conducted, there is still a lack of satisfactory results, due to the imprecision of the relative direction model of any two adjacent buildings and the ineffective extraction methods. This study aims to provide an alternative for quantifying the direction and the spatial continuity of any two buildings on the basis of the Delaunay triangulation for the recognition of linear building patterns. First, constrained Delaunay triangulations (CDTs) are created for all buildings within each block and every two adjacent buildings. Then, the spatial continuity index (SCI), the direction index (DI), and other spatial relations (e.g., distance) of every two adjacent buildings are derived using the CDT. Finally, the building block is modelled as a graph based on derived matrices, and a graph segmentation approach is proposed to extract linear building patterns. In the segmentation process, the edges of the graph are removed first, according to the global thresholds of the SCI and distance, and are subsequently subdivided into subgraphs on direction rules. The proposed method is tested using three datasets. The experimental results suggest that the proposed method can recognize both collinear and curvilinear building patterns, given that the correctness values are all above 92% for the three study areas. The results also demonstrate that the novel SCI can effectively filter many insignificant neighbor relationships in the graph segmentation process. It is noteworthy that the proposed DI is capable of measuring building relative directions accurately and works efficiently in linear building pattern extraction. Numéro de notice : A2020-267 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/ijgi9040231 date de publication en ligne : 09/04/2020 En ligne : https://doi.org/10.3390/ijgi9040231 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=95031 [article]

Reliable image matching via photometric and geometric constraints structured by Delaunay triangulation / San Jiang in ISPRS Journal of photogrammetry and remote sensing, vol 153 (July 2019)  

Permalink

Tile & merge: Distributed Delaunay triangulations for cloud computing / Laurent Caraffa (2019)  

Permalink

Road safety evaluation through automatic extraction of road horizontal alignments from Mobile LiDAR System and inductive reasoning based on a decision tree / José Antonio Martin-Jimenez in ISPRS Journal of photogrammetry and remote sensing, vol 146 (December 2018)  

Permalink

Voronoi tessellation on the ellipsoidal earth for vector data / Christos Kastrisios in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)  

Permalink

Optimization of deformation monitoring networks using finite element strain analysis / M. Amin Alizadeh-Khameneh in Journal of applied geodesy, vol 12 n° 2 (April 2018)  

Permalink

A typification method for linear pattern in urban building generalisation / Xianyong Gong in Geocarto international, vol 33 n° 2 (February 2018)  

Permalink

An automated displaced proportional circle map using Delaunay triangulation and an algorithm for node overlap removal / David Lamb in Cartographica, vol 52 n° 4 (Winter 2017)  

Permalink

On visibility and empty-region graphs / Sagi Katz in Computers and graphics, vol 66 (August 2017)  

Permalink

Extracting urban functional regions from points of interest and human activities on location-based social networks / Song Gao in Transactions in GIS, vol 21 n° 3 (June 2017)  

Permalink

The analysis and measurement of building patterns using texton co-occurrence matrices / Wenhao Yu in International journal of geographical information science IJGIS, vol 31 n° 5-6 (May-June 2017)  

Permalink