Online Version - Last Updated - 20 Jan 2012 |
 |
| Home |
| |
| Procedures and Resources for Authors |
|
| Information and Resources for Volume Editors |
| |
| Orders and Subscriptions |
| |
| Published Articles |
|
| Upcoming Volumes |
| |
| Contact Us |
| |
| Useful External Links |
| |
| CRPIT Site Search |
The Metro Map Layout Problem
Hong, S.-H., Merrick, D. and Nascimento, H.A.D.d.
We address a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We present a method to produce a good layout of a metro map automatically. Our method uses a variation of the spring algorithm with a suitable pre-processing step. The experimental results with real world data sets show that our approach is promising.
Cite as: Hong, S.-H., Merrick, D. and Nascimento, H.A.D.d. (2004). The Metro Map Layout Problem. In Proc. Australasian Symposium on Information Visualisation, (invis.au'04), Christchurch, New Zealand. CRPIT, 35. Churcher, N. and Churcher, C., Eds. ACS. 91-100.
(from crpit.com)
(local if available)
