Centre de documentation
scientifique

A computer science perspective on the bend simplification algorithm / M. Visvalingam in Cartography and Geographic Information Science, vol 26 n° 4 (October 1999)  

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

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
032-99041	RAB	Revue	Centre de documentation	En réserve L003	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)  

Public [article]  inCartography and geographic information systems > vol 22 n° 4 (December 1995) . - pp 264 - 275 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éralisation Ré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 [article]

Exemplaires(1)

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

Line generalisation by repeated elimination of points / M. Visvalingam in Cartographic journal (the), vol 30 n° 1 (June 1993)  

Public [article]  inCartographic journal (the) > vol 30 n° 1 (June 1993) . - pp 46 - 51 Titre : Line generalisation by repeated elimination of points Type de document : Article/Communication Auteurs : M. Visvalingam, Auteur ; J.D. Whyatt, Auteur Année de publication : 1993 Article en page(s) : pp 46 - 51 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] algorithme de Douglas-Peucker [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 [Vedettes matières IGN] Généralisation Résumé : (Auteur) This paper presents a new approach to line generalisation which uses the concept of 'effective area' for progressive simplification of a line by point elimination. Two coastlines are used to compare the performance of this, with that of the widely used Douglas-Peucker, algorithm. The results from the areabased algorithm compare favourably with manual generalisation of the same lines. It is capable of achieving both imperceptible minimal simplifications and caricatural generalisations. By careful selection of cut-off values, it is possible to use the same algorithm for scaledependent and scaleindependent generalisations. More importantly, it offers scope for modelling cartographic lines as consisting of features within features so that their geometric manipulation may be modified by application- -and/ or userdefined rules and weights. The paper examines the merits and limitations of the algorithm and the opportunities it offers for further research and progress in the field of line generalisation. Numéro de notice : A1993-027 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1179/000870493786962263 En ligne : https://www.tandfonline.com/doi/abs/10.1179/000870493786962263 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=25693 [article]

Exemplaires(1)

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