TY - JOUR

T1 - A new algorithm for distance cartogram construction

AU - Shimizu, Eihan

AU - Inoue, Ryo

PY - 2009/11

Y1 - 2009/11

N2 - 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.

AB - 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.

KW - Distance cartogram

KW - Time-space map

KW - Visualization

UR - http://www.scopus.com/inward/record.url?scp=70350778382&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350778382&partnerID=8YFLogxK

U2 - 10.1080/13658810802186882

DO - 10.1080/13658810802186882

M3 - Article

AN - SCOPUS:70350778382

VL - 23

SP - 1453

EP - 1470

JO - International Journal of Geographical Information Science

JF - International Journal of Geographical Information Science

SN - 1365-8816

IS - 11

ER -