Descripteur
Termes IGN > cartographie > conception cartographique > généralisation cartographique > simplification de contour > algorithme de Douglas-Peucker
algorithme de Douglas-PeuckerVoir aussi |
Documents disponibles dans cette catégorie (37)
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
A computer science perspective on the bend simplification algorithm / M. Visvalingam in Cartography and Geographic Information Science, vol 26 n° 4 (October 1999)
[article]
Titre : A computer science perspective on the bend simplification algorithm Type de document : Article/Communication Auteurs : M. Visvalingam, Auteur ; S. Herbert, Auteur Année de publication : 1999 Article en page(s) : pp 253 - 270 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Cadastre numérique
[Termes IGN] algorithme de Douglas-Peucker
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] lissage de courbe
[Termes IGN] objet géographique linéaireRésumé : (Auteur) The primary aim of this study was to evaluate whether the use of bends provides a better basis than point elimination for research on line structuring. These investigations were undertaken using Arc/Info 7.1.1. Comparative experimental results suggest that the algorithm may not be as widely applicable as the much simpler geometric filters, such as the Douglas-Peucker or Visvalingam algorithms. The paper therefore provides a brief review of these three algorithms. A more detailed conceptual and empirical evaluation of the bendsimplification system follows, highlighting some problems with implementing the system in Arc/Info. The paper then questions the value of over-coupling model- and image-oriented generalization processes within the black-box simplification system. It suggests the type of parameters which could enhance the utility and usability of the Bendsimplify option within the Arc/Info (and perhaps also within the ArcView) environment and provides some pointers for further research. With respect to the main aim of the research, the evidence suggests that bendsimplification is less useful for line segmentation than Visvalingam's algorithm. Further research is needed to assess the value of the iterative bend elimination operator within bendsimplification. Numéro de notice : A1999-175 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304099782294177 En ligne : https://doi.org/10.1559/152304099782294177 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26373
in Cartography and Geographic Information Science > vol 26 n° 4 (October 1999) . - pp 253 - 270[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 032-99041 RAB Revue Centre de documentation En réserve L003 Disponible Line simplification, geometric distorsion and positional error / H. Veregin in Cartographica, vol 36 n° 1 (March 1999)
[article]
Titre : Line simplification, geometric distorsion and positional error Type de document : Article/Communication Auteurs : H. Veregin, Auteur Année de publication : 1999 Article en page(s) : pp 25 - 39 Note générale : Bibliographie 1 page Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Cartographie numérique
[Termes IGN] algorithme de Douglas-Peucker
[Termes IGN] arc
[Termes IGN] cours d'eau
[Termes IGN] erreur de positionnement
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] lissage de courbe
[Termes IGN] noeud
[Termes IGN] objet géographique linéaire
[Termes IGN] réseau routierRésumé : (Auteur) Line simplification is a generalization method that involves the selective elimination of vertices along a cartographic line. This procedure can introduce positional error by distorting line geometry. This study focuses on the quantification of this distortion with specific reference to the Douglas-Peucker line-simplification algorithm. Results based on US Geological Survey Digital Line Graph (DLG) data for streams and roads show that the algorithm is often suboptimal; that is, the amount of geometric distortion per eliminated vertex is generally not minimized. As the amount of simplification increases, the degree of suboptimality increases in absolute terms but declines in relative terms when compared to the entire distribution of possible distortion values. Significant differences in performance are observed for streams and roads, due to the higher error potential for roads as a function of their geometry.
Etude sur la quantification de la distorsion (erreur de position) lors de la modification géométrique de la ligne (route ou cours d'eau) avec l'algorithme de simplification de ligne de Douglas-Peucker. L'algorithme n'est pas souvent optimisé. La distorsion géométrique correspondant à chaque sommet éliminé n'est pas minimisée. Comme la simplification augmente, le degré de sous-optimisation augmente en termes absolus mais diminue en termes relatifs en comparaison avec la distribution entière de valeurs de distorsion possibles. On observe des différences significatives de performance sur les cours d'eau et les routes à cause du potentiel d'erreur plus élevé sur les routes en fonction de leur géométrie.Numéro de notice : A1999-108 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.3138/D7R4-M1M7-6632-73X1 En ligne : https://doi.org/10.3138/D7R4-M1M7-6632-73X1 Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26313
in Cartographica > vol 36 n° 1 (March 1999) . - pp 25 - 39[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 031-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]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 032-99011 RAB Revue Centre de documentation En réserve L003 Disponible Generalisation methods for propagating updates between cartographic data sets / Lars Harrie (1998)
Titre : Generalisation methods for propagating updates between cartographic data sets : Licentiate thesis Type de document : Mémoire Auteurs : Lars Harrie, Auteur Editeur : Lund [Suède] : Lund University Année de publication : 1998 Importance : 127 p. Format : 15 x 21 cm ISBN/ISSN/EAN : 978-91-630-7502-5 Note générale : Bibliographie
Licentiate thesisLangues : Anglais (eng) Descripteur : [Termes IGN] algorithme de Douglas-Peucker
[Termes IGN] B-Spline
[Termes IGN] filtre de Gauss
[Termes IGN] généralisation cartographique
[Termes IGN] Lamps2
[Termes IGN] modèle (conceptuel) de généralisation
[Termes IGN] opérateur de généralisation
[Termes IGN] programmation par contraintes
[Termes IGN] prototype
[Termes IGN] relation topologique
[Termes IGN] représentation multiple
[Vedettes matières IGN] GénéralisationIndex. décimale : 37.70 Généralisation Résumé : (Auteur) Automation is increasingly important in producing and maintaining cartographic data sets. This thesis deals with automatic methods to propagate updates between cartographic data sets. The major idea is to update only the most detailed data set (master data set) and then propagate these updates automatically to less detailed data sets (target data sets). The approach used is firstly to formulate linguistic rules for the update process. The information sources for these linguistic rules are data set specifications, cartographic data sets, paper maps and practising cartographers. These linguistic rules are translated into logical rules and then implemented in a prototype system. The prototype system is built on top of an object-oriented map production software. The system requires a multiple representation database, which consists of cartographic data sets at different scales together with connectivities between those objects that refer to the same physical entities. The prototype system is built on a conceptual framework of four steps: examination, propagation, generalisation of updates and solving spatial conflicts. The aim of the examination step is to determine which object should be created, modified or deleted in the target data set. The action is dependent on the current status of the target data set and the properties of the update to the master data set. The propagation step executes the outcome of the examination step. Furthermore, this step validates the updates and maintains the integrity of the multiple representation databas6. In the next step — generalisation of updates — the new or modified object in the target data set is generalised to suit the scale of the target data set. The final step treats spatial conflicts due to the update. A new method is proposed for solving spatial conflicts, called the constraint method, which is a generic method that resembles manual generalisation on a conceptual level. Note de contenu : 1 - Cartographic concepts
2 - Spatial concepts
3 - Previous work on generalisation
4 - The constraint method
5 - Prototype system of incremental generalisation
6 - Discussion and concluding remarksNuméro de notice : 21509 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Mémoire licence Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90349 Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 21509-01 37.70 Livre Centre de documentation Géomatique Disponible Simplification and generalization of large scale data for roads: a comparison of two filtering algorithms / M. Visvalingam in Cartography and geographic information systems, vol 22 n° 4 (December 1995)
[article]
Titre : Simplification and generalization of large scale data for roads: a comparison of two filtering algorithms Type de document : Article/Communication Auteurs : M. Visvalingam, Auteur ; P.J. Williamson, Auteur Année de publication : 1995 Article en page(s) : pp 264 - 275 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme de Douglas-Peucker
[Termes IGN] algorithme de filtrage
[Termes IGN] algorithme de Visvalingam
[Termes IGN] analyse comparative
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] lissage de courbe
[Termes IGN] objet géographique linéaire
[Termes IGN] photographie à grande échelle
[Termes IGN] réseau routier
[Termes IGN] route
[Termes IGN] segmentation
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) This paper reports the results of an indepth study which investigated two algorithms for line simplification and caricatural generalization (namely, those developed by Douglas and Peucker, and Visvalingam, respectively) in the context of a wider program of research on scalefree mapping. The use of largescale data for man-designed objects, such as roads, has led to a better understanding of the properties of these algorithms and of their value within the spectrum of scalefree mapping. The Douglas-Peucker algorithm is better at minimal simplification. The large-scale data for roads makes it apparent that Visvalingam's technique is not only capable of removing entire scale-related features, but that it does so in a manner which preserves the shape of retained features. This technique offers some prospects for the construction of scalefree databases since it offers some scope for achieving balanced generalizations of an entire map, consisting of several complex lines. The results also suggest that it may be easier to formulate concepts and strategies for automatic segmentation of inline features using largescale road data and Visvalingam's algorithm. In addition, the abstraction of center lines may be facilitated by the inclusion of additional filtering rules with Visvalingam's algorithm. Numéro de notice : A1995-007 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304095782540249 En ligne : https://www.tandfonline.com/doi/abs/10.1559/152304095782540249 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=25737
in Cartography and geographic information systems > vol 22 n° 4 (December 1995) . - pp 264 - 275[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 032-95041 RAB Revue Centre de documentation En réserve L003 Disponible Recherche d'outils et de représentations pour la généralisation / Emmanuel Fritsch (1994)PermalinkLine generalisation by repeated elimination of points / M. Visvalingam in Cartographic journal (the), vol 30 n° 1 (June 1993)Permalink[Généralisation cartographique et algorithmes] / Gilles Roussin (1993)PermalinkGénéralisation automatique en cartographie / Nicolas Lambert (1992)PermalinkThe impact of different mathematical approaches to contouring / T.K. Peucker in Cartographica, vol 17 n° 2 (June 1980)PermalinkLa cartographie mondiale. Volume 15 / Nations Unies (1979)PermalinkA theory of the cartographic line / T.K. Peucker in Annuaire international de cartographie, n° 16 (1976)Permalink