Descripteur
Termes IGN > géomatique > base de données localisées > généralisation automatique de données > généralisation cartographique automatisée
généralisation cartographique automatiséeVoir aussi |
Documents disponibles dans cette catégorie (403)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
The constraint method for solving spatial conflicts in cartographic generalization / Lars Harrie in Cartography and Geographic Information Science, vol 26 n° 1 (January 1999)
[article]
Titre : The constraint method for solving spatial conflicts in cartographic generalization Type de document : Article/Communication Auteurs : Lars Harrie, Auteur Année de publication : 1999 Article en page(s) : pp 55 - 69 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] conflit d'espace
[Termes IGN] déplacement d'objet géographique
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] implémentation (informatique)
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) New methods are needed to automate cartographic generalization. This article presents a method for automating the displacement of vector data, called the constraint method. The framework of the method consists of five displacement behavior types. Each cartographic object type belongs to one of these displacement behavior types, which determines the properties of the object type in the displacement process. The displacement behavior types are specified by a set of rules called constraints. The constraint method works as follows. First, it is determined which objects should participate in the displacement process. Then, for each object a set of constraints is set up, depending on its displacement behaviour type. All the constraints build up an overdetermined equation system. This equation system gives how much each object must be moved and/or distorted to solve the spatial conflict. The paper concludes with two applications. Numéro de notice : A1999-171 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304099782424884 En ligne : https://doi.org/10.1559/152304099782424884 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26369
in Cartography and Geographic Information Science > vol 26 n° 1 (January 1999) . - pp 55 - 69[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 032-99011 RAB Revue Centre de documentation En réserve L003 Disponible The development of phenomenological generalization within an object-oriented paradigm / D. Ormsby in Cartography and Geographic Information Science, vol 26 n° 1 (January 1999)
[article]
Titre : The development of phenomenological generalization within an object-oriented paradigm Type de document : Article/Communication Auteurs : D. Ormsby, Auteur ; William A Mackaness, Auteur Année de publication : 1999 Article en page(s) : pp 70 - 80 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] généralisation
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] généralisation géométrique (de visualisation)
[Termes IGN] modèle entité-association
[Termes IGN] modèle orienté objet
[Termes IGN] phénomène géographique
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) This paper presents a "phenomenological" framework that incorporates information relating to 1) an object's geometry, 2) its semantic properties, and 3) the interobject relationships. It is argued that this information is required in order to devise algorithms and design strategies capable of abstracting the meaning inherent in the phenomenon being mapped. The fundamental challenge is to design generic algorithms that are powerful and flexible enough to provide varying solutions according to this information. It is argued that this can be achieved by implementing functionality at the object level, and that the objectoriented paradigm provides a flexible modeling environment that obviates the need to develop bespoke algorithms for each and every feature type. This approach is applied to extend a geometric based algorithm for area feature generalization into a phenomena based algorithm which takes into account the semantic meaning and contextual relationships of the real world objects. Solutions derived from the algorithm demonstrate its success at generating varying results for different types of phenomena and map subjects. Numéro de notice : A1999-172 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304099782424910 En ligne : https://doi.org/10.1559/152304099782424910 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26370
in Cartography and Geographic Information Science > vol 26 n° 1 (January 1999) . - pp 70 - 80[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 032-99011 RAB Revue Centre de documentation En réserve L003 Disponible Topologically consistent line simplification with the Douglas-Peucker algorithm / A. Saalfeld in Cartography and Geographic Information Science, vol 26 n° 1 (January 1999)
[article]
Titre : Topologically consistent line simplification with the Douglas-Peucker algorithm Type de document : Article/Communication Auteurs : A. Saalfeld, Auteur Année de publication : 1999 Article en page(s) : pp 7 - 18 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Cartographie numérique
[Termes IGN] algorithme de Douglas-Peucker
[Termes IGN] échantillonnage de données
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] lissage de courbe
[Termes IGN] objet géographique linéaireRésumé : (Auteur) We examine key properties of the DouglasPeucker polyline simplification algorithm which are shared with many similar "vertex subsampling" algorithms. We examine how the Douglas-Peucker algorithm and similar algorithms can fail to maintain consistent or correct topological relations among features. We then prove that a simple test added to the stopping condition of DouglasPeuckerlike algorithms can guarantee that the resulting simplified polyline is topologically consistent with itself and with all of its neighboring features, and is correctly situated topologically with respect to all other features. We describe how a dynamically updated convex hull data structure may be used to efficiently detect and remove potential topological conflicts of the polyline with itself and with other features in that polyline's neighborhood. Numéro de notice : A1999-168 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304099782424901 En ligne : https://doi.org/10.1559/152304099782424901 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26366
in Cartography and Geographic Information Science > vol 26 n° 1 (January 1999) . - pp 7 - 18[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 032-99011 RAB Revue Centre de documentation En réserve L003 Disponible Experiments with Learning Techniques for Spatial Model Enrichment and Line Generalization / Corinne Plazanet in Geoinformatica, vol 2 n° 4 (December 1998)
[article]
Titre : Experiments with Learning Techniques for Spatial Model Enrichment and Line Generalization Type de document : Article/Communication Auteurs : Corinne Plazanet , Auteur ; Nara Martini Bigolin, Auteur ; Anne Ruas , Auteur Année de publication : 1998 Article en page(s) : pp 315 - 333 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] acquisition de connaissances
[Termes IGN] apprentissage dirigé
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] lissage de courbe
[Termes IGN] objet géographique linéaire
[Vedettes matières IGN] GénéralisationRésumé : (auteur) The nature of map generalization may be non-uniform along the length of an individual line, requiring the application of methods that adapt to the local geometry and the geographical context. Geographical databases need to be enriched in terms of shape description structures (geometrical knowledge), knowledge of appropriate order of operations and of appropriate algorithms (procedural knowledge). Stored knowledge should take account of semantic and morphological characteristics, and of cartographic constraints.
This paper proposes and discusses three experiments on knowledge acquisition using unsupervised and supervised learning techniques. In order to exploit geometrical shape knowledge, classifications were computed according to a set of morphological measures using unsupervised learning. Choice of appropriate operations was determined by the results of a test with IGN cartographers considering line characteristics. These results were given to a supervised learning algorithm, along with corresponding computed measures in order to discover rules. The approach and the resulting rules are presented and discussed. Tests have also been conducted on the tuning of parameter values, applying a Gaussian smoothing tolerance value to a set of lines using the supervised learning algorithm. The values obtained by means of the learning algorithm have been compared with interactive choices of an expert. Results are promising with a prediction rate higher than 80% having been obtained.Numéro de notice : A1998-144 Affiliation des auteurs : COGIT+Ext (1988-2011) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1023/A:1009753320636 En ligne : http://dx.doi.org/10.1023/A:1009753320636 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=98052
in Geoinformatica > vol 2 n° 4 (December 1998) . - pp 315 - 333[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-98041 RAB Revue Centre de documentation En réserve L003 Disponible Map production from an active object database, using dynamic representation and automated generalisation / P.G. Hardy in Cartographic journal (the), vol 35 n° 2 (December 1998)
[article]
Titre : Map production from an active object database, using dynamic representation and automated generalisation Type de document : Article/Communication Auteurs : P.G. Hardy, Auteur Année de publication : 1998 Article en page(s) : pp 181 - 189 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] base de données localisées
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] modèle orienté objet
[Termes IGN] représentation cartographique
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) Map production has been seen previously as a standalone task, compiling information together from various sources to produce a particular cartographic product. This traditional view is now challenged by the availability of new environments which bring together databasing, object data modelling, image analysis, active agent behaviour and automated cartography to produce a unified flow line for production of multiple maps, charts, and geospatial data. This paper overviews the capabilities of a modern map production application built around an objectoriented geospatial database, and specifically highlights its capabilities for active representation, multiple geometry and automated generalisation, in order to explore the benefits and future directions of active object mapping. Numéro de notice : A1998-205 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1179/caj.1998.35.2.181 En ligne : https://doi.org/10.1179/caj.1998.35.2.181 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26169
in Cartographic journal (the) > vol 35 n° 2 (December 1998) . - pp 181 - 189[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 030-98021 RAB Revue Centre de documentation En réserve L003 Disponible A method for building displacement in automated map generalisation / Anne Ruas in International journal of geographical information science IJGIS, vol 12 n° 8 (december 1998)PermalinkMulti-scale categorical data bases with automatic generalization transformations based on Map Algebra / Olli Jaakkola in Cartography and geographic information systems, vol 25 n° 4 (October 1998)PermalinkApproche et méthodes pour l'automatisation de la généralisation cartographique / Jean-François Hangouët (1998)PermalinkGénéralisation adaptative du linéaire basée sur la détection des empâtements : application au routier / Sébastien Mustière (1998)PermalinkPermalinkGénéralisation contextuelle / Anne Ruas (1998)PermalinkGénéralisation du linéaire : une approche nouvelle / Jean-Georges Affholder (1998)PermalinkGénéralisation du réseau / Emmanuel Fritsch (1998)PermalinkOO-contrainst modelling to automate urban generalisation process / Anne Ruas (1998)PermalinkReprésentations de la géométrie et des contraintes cartographiques pour la généralisation du linéaire routier / Emmanuel Fritsch (1998)Permalink