Centre de documentation
scientifique

Continuously generalizing buildings to built-up areas by aggregating and growing / Dongliang Peng (2017)  

Public Titre : Continuously generalizing buildings to built-up areas by aggregating and growing Type de document : Article/Communication Auteurs : Dongliang Peng, Auteur ; Guillaume Touya , Auteur Editeur : New York [Etats-Unis] : Association for computing machinery ACM Année de publication : 2017 Conférence : UrbanGIS 2017, 3rd ACM SIGSPATIAL workshop 07/11/2017 10/11/2017 Redondo Beach Californie - Etats-Unis Proceedings ACM Langues : Anglais (eng) Descripteur : [Termes IGN] bati [Termes IGN] construction [Termes IGN] distance euclidienne [Termes IGN] mise à l'échelle [Termes IGN] polygone [Termes IGN] simplification de contour [Vedettes matières IGN] Généralisation Résumé : (auteur) To enable smooth zooming, we propose a method to continuously generalize buildings from a given start map to a smaller-scale goal map, where there are only built-up area polygons instead of individual building polygons. We name the buildings on the start map original buildings. For an intermediate scale, we aggregate the original buildings that will become too close by adding bridges. We grow (bridged) original buildings based on buffering, and simplify the grown buildings. We take into account the shapes of the buildings both at the previous map and goal map to make sure that the buildings are always growing. The running time of our method is in O (n3), where n is the number of edges of all the original buildings. The advantages of our method are as follows. First, the buildings grow continuously and, at the same time, are simplified. Second, right angles of buildings are preserved during growing: the merged buildings still look like buildings. Third, the distances between buildings are always larger than a specified threshold. We do a case study to show the performances of our method. Numéro de notice : C2017-027 Affiliation des auteurs : LASTIG COGIT+Ext (2012-2019) Thématique : GEOMATIQUE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl DOI : 10.1145/3152178.3152188 Date de publication en ligne : 01/12/2017 En ligne : https://doi.org/10.1145/3152178.3152188 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89290

Morphing linear features based on their entire structures / Min Deng in Transactions in GIS, vol 19 n° 5 (October 2015)  

Public [article]  inTransactions in GIS > vol 19 n° 5 (October 2015) . - pp 653 – 677 Titre : Morphing linear features based on their entire structures Type de document : Article/Communication Auteurs : Min Deng, Auteur ; Dongliang Peng, Auteur Année de publication : 2015 Article en page(s) : pp 653 – 677 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] algorithme de Douglas-Peucker [Termes IGN] arbre-B [Termes IGN] généralisation cartographique [Termes IGN] interpolation linéaire [Termes IGN] morphologie mathématique [Termes IGN] polyligne [Termes IGN] représentation cartographique [Termes IGN] triangulation de Delaunay Résumé : (auteur) In this article, a new morphing method is proposed for two linear features at different scales, based on their entire structures (MLBES in abbreviation). First, the bend structures of the linear features are identified by using a constrained Delaunay triangulation (CDT in abbreviation) model and represented by binary bend-structure trees. By matching the independent bends represented by the bend-structure trees, corresponding independent bends are obtained. These corresponding independent bends are further used to match their child bends based on hierarchical bend structures so that corresponding bends are obtained. On this basis, the two linear features are split into pairs of corresponding subpolylines by the start and end points of the corresponding bends. Second, structures of the corresponding subpolylines are identified by the Douglas-Peucker algorithm and represented by binary line generalization trees (BLG-trees in abbreviation). The corresponding subpolylines are split into smaller corresponding subpolylines by matching the nodes of the BLG-trees. Third, the corresponding points are identified by using the linear interpolation algorithm for every pair of corresponding subpolylines. Finally, straight-line trajectories are employed to generate a family of intermediate-scale linear features. By comparison with other methods, it is found that MLBES is accurate and efficient. Numéro de notice : A2015-682 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12111 En ligne : http://dx.doi.org/10.1111/tgis.12111 Format de la ressource électronique : Url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=78313 [article]