Centre de documentation
scientifique

Dépouillements

Computational processes for map generalization / D.E. Richardson in Cartography and Geographic Information Science, vol 26 n° 1 (January 1999)  

Public [article]  inCartography and Geographic Information Science > vol 26 n° 1 (January 1999) . - pp 3 - 5 Titre : Computational processes for map generalization Type de document : Article/Communication Auteurs : D.E. Richardson, Auteur ; William A Mackaness, Auteur Année de publication : 1999 Article en page(s) : pp 3 - 5 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] généralisation cartographique automatisée [Vedettes matières IGN] Généralisation Numéro de notice : A1999-167 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304099782424938 En ligne : https://doi.org/10.1559/152304099782424938 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26365 [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)  

Public [article]  inCartography and Geographic Information Science > vol 26 n° 1 (January 1999) . - pp 7 - 18 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éaire Ré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 [article]

Exemplaires(1)

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

Cartographic line generalization with waterlines and medial-axes / A.H.J. Christensen in Cartography and Geographic Information Science, vol 26 n° 1 (January 1999)  

Public [article]  inCartography and Geographic Information Science > vol 26 n° 1 (January 1999) . - pp 19 - 32 Titre : Cartographic line generalization with waterlines and medial-axes Type de document : Article/Communication Auteurs : A.H.J. Christensen, Auteur Année de publication : 1999 Article en page(s) : pp 19 - 32 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] agrégation de détails [Termes IGN] élimination de points [Termes IGN] généralisation cartographique automatisée [Termes IGN] lissage de courbe [Termes IGN] objet géographique linéaire [Termes IGN] trait de côte [Vedettes matières IGN] Généralisation Résumé : (Auteur) A line generalization solution is presented based on the operations known as waterlining and medialaxis transformation. Although the solution is of general application, this report focuses on shorelines. The method is shown to preserve the general shape of a line through very broad scale changes ; it also makes it possible to perform feature aggregation and elimination, where needed. Each scale change is proven to depend on the maximum distance spanned by the waterlining operation, which distance can be equated to the quantity known as in the generalization literature. The challenges encountered in the development of the generalization procedure are discussed ; these challenges are less on the side of line simplification and more in the aggregation of features. Solutions are presented for broadening isthmus, linkages to streams and rivers, and the collapsing of straits into double and coincident lines. Particular shoreline configurations are shown to lead to ambiguities in feature aggregation and elimination that require user's input in order to be resolved. Intermediate results are found to replicate those submitted 39 years ago by Julian Perkal in his proposal for an objective generalization. Numéro de notice : A1999-169 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304099782424893 En ligne : https://www.tandfonline.com/doi/abs/10.1559/152304099782424893 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26367 [article]

Exemplaires(1)

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

Scale, sinuosity, and point selection in digital line generalization / Geoffrey Dutton in Cartography and Geographic Information Science, vol 26 n° 1 (January 1999)  

Public [article]  inCartography and Geographic Information Science > vol 26 n° 1 (January 1999) . - pp 33 - 53 Titre : Scale, sinuosity, and point selection in digital line generalization Type de document : Article/Communication Auteurs : Geoffrey Dutton, Auteur Année de publication : 1999 Article en page(s) : pp 33 - 53 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] échelle cartographique [Termes IGN] généralisation cartographique automatisée [Termes IGN] lissage de courbe [Termes IGN] méthode robuste [Termes IGN] objet géographique linéaire [Termes IGN] sinuosité [Vedettes matières IGN] Généralisation Résumé : (Auteur) This paper examines some assumptions and results of cartographic line simplification in the digital realm, focusing upon two major aspects of map generalizationscalespecificity and the concept of characteristic points. These are widely regarded as critical controls to generalization but, in our estimation, they are rarely well considered or properly applied. First, a look at how scale and shape are treated in various research papers identifies some important conceptual and methodological issues that either have been misconstrued or inadequately treated. We then conduct an empirical analysis with a set of line generalization experiments that control resolution, detail, and sinuosity using four source datasets. The tests yield about 100 different versions of two island coastlines digitized at two scales, exploring systematically the consequences of linking scale with spatial resolution as well as a variety of point selection strategies. The generalized results are displayed (at scale and enlarged) along with some basic statistics. We conclude with a set of observations on the need for more careful and robust evaluations of strategies for point selection and for atscale verification of visual quality. The results indicate that regardless of which methods are used, sensitivity to scale and sinuosity can and must be built into all digital map generalization toolkits. Numéro de notice : A1999-170 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304099782424929 En ligne : https://doi.org/10.1559/152304099782424929 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26368 [article]

Exemplaires(1)

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

The constraint method for solving spatial conflicts in cartographic generalization / Lars Harrie in Cartography and Geographic Information Science, vol 26 n° 1 (January 1999)  

Public [article]  inCartography and Geographic Information Science > vol 26 n° 1 (January 1999) . - pp 55 - 69 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éralisation Ré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 [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)  

Public [article]  inCartography and Geographic Information Science > vol 26 n° 1 (January 1999) . - pp 70 - 80 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éralisation Ré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 [article]

Exemplaires(1)

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