Automatic visualisation of metro maps
Saved in:
| Title: | Automatic visualisation of metro maps |
|---|---|
| Authors: | Hong, Seok-Hee1 shhong@it.usyd.edu.au, Merrick, Damian1 dmerrick@it.usyd.edu.au, do Nascimento, Hugo A.D.2 hadn@inf.ufg.br |
| Source: | Journal of Visual Languages & Computing. Jun2006, Vol. 17 Issue 3, p203-224. 22p. |
| Subjects: | Memory maps (Computer science), Data visualization, Algorithms, Experimental design |
| Abstract: | Abstract: We investigate the new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic criteria for good metro map layouts and present a method to produce such layouts automatically. Our method uses a variation of the spring algorithm with a suitable preprocessing step. The experimental results with real world data sets show that our method produces good metro map layouts quickly. [Copyright &y& Elsevier] |
| Copyright of Journal of Visual Languages & Computing is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
