Centre de documentation
scientifique

Dépouillements

Using an energy minimization technique for polygon generalization / M. Galanda in Cartography and Geographic Information Science, vol 30 n° 3 (July 2003)  

Public [article]  inCartography and Geographic Information Science > vol 30 n° 3 (July 2003) . - pp 263 - 279 Titre : Using an energy minimization technique for polygon generalization Type de document : Article/Communication Auteurs : M. Galanda, Auteur ; Robert Weibel, Auteur Année de publication : 2003 Article en page(s) : pp 263 - 279 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] conflit d'espace [Termes IGN] généralisation cartographique automatisée [Termes IGN] lisibilité perceptive [Termes IGN] lissage de courbe [Termes IGN] méthode de réduction d'énergie [Termes IGN] polygone [Termes IGN] précision métrique [Vedettes matières IGN] Généralisation Résumé : (Auteur) Snakes are iterative energy-minimizing splines controlled by both internal constraint forces (internal energy) and external forces (external energy). This paper investigates the use of snakes for the resolution of conflicts in polygonal subdivisions (i.e., polygon maps or polygon mosaics) resulting from the violation of metric constraints which exist if a polygonal object is too small, too narrow, or too close to another polygon. Such metric conflicts are denoted as size and proximity conflicts. In the generalization of polygonal subdivisions, internal energy reflects the resistance of an object to deformation and external energy describes the need for generalization. This paper suggests the usage of a snakes-based algorithm which is triggered in such a way that it achieves the translation, a local and global increase (or decrease) of polygons, or an arbitrary combination of these transformations, depending on the conflicts encountered. Hence, size and proximity conflicts within a group of polygons can be solved simultaneously and holistically. Furthermore, snakes support the propagation of a change of a polygon's geometry to all adjacent neighbors. The proposed algorithm has been implemented in a prototype system that also supports a variety of other polygon generalization algorithms. The main difficulties identified are the intricate setup and finetuning of the snakes parameters and the computer resources required by the algorithm. However, the experiments showed that the proposed algorithm is a valuable method for the automated generalization of polygonal subdivisions. Numéro de notice : A2003-240 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304003100011199 En ligne : https://doi.org/10.1559/152304003100011199 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=22535 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
032-03031	RAB	Revue	Centre de documentation	En réserve L003	Disponible