Centre de documentation
scientifique

A new algorithm for distance cartogram construction / E. Shimizu in International journal of geographical information science IJGIS, vol 23 n°11-12 (november 2009)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 23 n°11-12 (november 2009) . - pp 1453 - 1470 Titre : A new algorithm for distance cartogram construction Type de document : Article/Communication Auteurs : E. Shimizu, Auteur ; R. Inoue, Auteur Année de publication : 2009 Article en page(s) : pp 1453 - 1470 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse spatio-temporelle [Termes IGN] cartogramme [Termes IGN] distance euclidienne [Termes IGN] Japon [Termes IGN] outil d'aide à la décision [Termes IGN] réseau ferroviaire [Termes IGN] ville Résumé : (Auteur) A distance cartogram is a diagram that visualizes the proximity indices between points in a network, such as time-distances between cities. The Euclidean distances between the points on the distance cartogram represent the given proximity indices. This is a useful visualization tool for the level of service of transport, e.g. difference in the level of service between regions or points in a network and its improvement in the course of time. The two previously proposed methods—multidimensional scaling (MDS) and network time-space mapping—have certain advantages and disadvantages. However, we observe that these methods are essentially the same, and the merits of both these methods can be combined to formulate a generalized solution. In this study, we first formulate the time-space mapping problem, which includes the key features of both of the above stated methods, and propose a generalized solution. We then apply this solution to the time-distances of Japan's railway networks to confirm its applicability. Copyright Taylor & Francis Numéro de notice : A2009-516 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810802186882 En ligne : https://doi.org/10.1080/13658810802186882 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30145 [article]

Exemplaires(2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-09071	RAB	Revue	Centre de documentation	En réserve L003	Disponible
079-09072	RAB	Revue	Centre de documentation	En réserve L003	Disponible

A new algorithm for continuous area cartogram construction with triangulation of regions and restriction on bearing changes of edges / R. Inoue in Cartography and Geographic Information Science, vol 33 n° 2 (April 2006)  

Public [article]  inCartography and Geographic Information Science > vol 33 n° 2 (April 2006) . - pp 115 - 125 Titre : A new algorithm for continuous area cartogram construction with triangulation of regions and restriction on bearing changes of edges Type de document : Article/Communication Auteurs : R. Inoue, Auteur ; E. Shimizu, Auteur Année de publication : 2006 Article en page(s) : pp 115 - 125 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Cartographie numérique [Termes IGN] cartogramme [Termes IGN] démographie [Termes IGN] données statistiques [Termes IGN] Etats-Unis [Termes IGN] méthode des moindres carrés [Termes IGN] triangulation de Delaunay Résumé : (Auteur) A continuous area cartogram is a transformed map in which regions are resized relative to their data. It is considered an effective visualization tool for statistical data, and many solutions have been proposed. However, most of these solutions are not mathematically clear or user friendly; further, they do not provide visually elegant area cartograms. An essential condition for the construction of a visually elegant area cartogram is that the resultant region shape should resemble the corresponding regions on geographical maps. Since it is impossible to determine the shape of a region based only on the information of size, area cartogram construction is an ill-posed problem that requires regularization. In this study, we propose a construction algorithm that involves triangulation of regions and regularization through restrictions on the bearing changes of the edges in order to obtain visually clear results. First, we formulate a construction using nonlinear least squares. Then, by linearizing, we derive a simple formula to create area cartograms. The application of our algorithm to the USA population datasets reveals that our algorithm has mathematical clarity and is user friendly. Copyright CaGISociety Numéro de notice : A2006-286 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1559/152304006777681698 En ligne : https://doi.org/10.1559/152304006777681698 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28013 [article]

Exemplaires(1)

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