Centre de documentation
scientifique

Formalization and data enrichment for automated evaluation of building pattern preservation / Xiang Zhang (2010)    

Public Titre : Formalization and data enrichment for automated evaluation of building pattern preservation Type de document : Article/Communication Auteurs : Xiang Zhang, Auteur ; Jantien E. Stoter, Auteur ; Tinghua Ai, Auteur ; Menno-Jan Kraak, Auteur Editeur : International Society for Photogrammetry and Remote Sensing ISPRS Année de publication : 2010 Conférence : ISPRS 2010, Commission 2, Joint International Conference on Theory, Data Handling and Modelling 26/05/2010 28/05/2010 Hong Kong Hong Kong OA ISPRS Archives Importance : 6 p. Note générale : bibliographie Langues : Français (fre) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] appariement de modèles conceptuels de données [Termes IGN] évaluation des données [Termes IGN] généralisation automatique de données [Termes IGN] généralisation cartographique automatisée [Termes IGN] lisibilité perceptive [Termes IGN] modèle géométrique du bâti [Termes IGN] programmation par contraintes Résumé : (auteur) Automated evaluation of generalization output relies to a large extent on that requirements (e.g. specifications, constraints) being formalized in machine-readable formats. Previous studies suggest that the formalization and automated evaluation are relatively easier for legibility constraints (improve the readability of maps) than for preservation constraints (preserving important real-world phenomena). Three major difficulties, i.e., pattern classification and characterization, pattern matching, and constraint formalization, in the automated evaluation of building pattern preservation constraint are analyzed in this paper. A classification of available building patterns is reviewed based on a previous work. In addition, the transition events describing allowed changes for building patterns to preserve during generalization are obtained through the study of existing maps series (from 1:10k to 1:100k). Based on the obtained knowledge on pattern types and acceptable transition events, an approach to automatically match corresponding building patterns at different scales is presented. The methodology proposed is validated by applying it to the interactively generalized data. The result shows promising results and also further improvement in order to apply the method in an overall evaluation to indicate acceptable generalization solutions. Numéro de notice : 14813 Affiliation des auteurs : non IGN Nature : Communication DOI : sans En ligne : https://www.isprs.org/proceedings/XXXVIII/part2/Papers/12_Paper.pdf Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=73993

Documents numériques

en open access 14813 Formalization and data enrichment Adobe Acrobat PDF

Validation of Planar Partitions Using Constrained Triangulation / Hugo Ledoux (2010)  

Public Titre : Validation of Planar Partitions Using Constrained Triangulation Type de document : Article/Communication Auteurs : Hugo Ledoux, Auteur ; Martijn Meijers, Auteur Editeur : International Society for Photogrammetry and Remote Sensing ISPRS Année de publication : 2010 Collection : International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences, ISSN 1682-1750 num. 38-2 Conférence : ISPRS 2010, Commission 2, Joint International Conference on Theory, Data Handling and Modelling 26/05/2010 28/05/2010 Hong Kong Hong Kong OA ISPRS Archives Importance : 6 p. Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] cohérence géométrique [Termes IGN] cohérence logique [Termes IGN] graphe planaire [Termes IGN] partition [Termes IGN] polygone [Termes IGN] tessellation [Termes IGN] triangulation de Delaunay Résumé : (auteur) Planar partitions—full tessellations of the plane into non-overlapping polygons—are frequently used in GIS to model concepts such as land cover, cadastral parcels or administrative boundaries. Since in practice planar partitions are often stored as a set of individual objects (polygons) to which attributes are attached (e.g. stored with a shapefile), and since different errors/mistakes can be introduced during their construction, manipulation or exchange, several inconsistencies will often arise in practice. The inconsistencies are for instance overlapping polygons, gaps and unconnected polygons. We present in this paper a novel algorithm to validate such planar partitions. It uses a constrained triangulation as a support for the validation, and permits us to avoid different problems that arise with existing solutions based on the construction of a planar graph. We describe in the paper the details of our algorithm, our implementation, how inconsistencies can be detected, and the experiments we have made with real-world data (the CORINE2000 dataset). Numéro de notice : 14814 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Communication DOI : sans En ligne : http://www.isprs.org/proceedings/XXXVIII/part2/Papers/24_Paper.pdf Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=73994