Path simplification for metro map layout

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4372 LNCS, Issue , 2007, Pages 258-269

  Merrick, Damian ^a,b   Gudmundsson, Joachim ^b  

^a UNIVERSITY OF SYDNEY   (Australia)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; REAL TIME SYSTEMS;

LINE SEGMENTS; POLYGONAL PATHS; RAILWAY NETWORKS;

GRAPH THEORY;

EID: 38149095898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_26     Document Type: Conference Paper

References (29)

1. H. Alt and M. Godau. Measuring the resemblance of polygonal curves. In Proc. 8th Annual Symposium on Computational Geometry, p. 102-109, 1992.
2. P. K. Agarwal and K. R. Varadarajan. Efficient Algorithms for Approximating Polygonal Chains. Discrete & Computational Geometry, 23(2):273-291, 2000.
3. J. Bose, O. Cheong, S. Cabello, J. Gudmundsson, M. van Kreveld and B. Speckinann. Area-preserving approximations of polygonal paths. J. Discrete Alg., 2006.
4. G. Barequet, D. Z. Chen, O. Daescu, M. T. Goodrich and J. Snoeyink. Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica, 33(2):150-167, 2002.
5. S. Cabello, M. de Berg, and M. van Kreveld. Schematization of networks. Computational Geometry and Applications, 30:223-238, 2005.
6. W. S. Chan and F. Chin. Approximation of polygonal curves with minimum number of line segments or minimum error. IJCGA, 6:59-77, 1996.
7. D. Z. Chen and O. Daescu. Space-efficient algorithms for approximating polygonal curves in two-dimensional space. IJCGA, 13:95-111, 2003.
8. D. Z. Chen, O. Daescu, J. Hershberger, P. M. Kogge, N. Mi and J. Snoeyink. Polygonal path simplification with angle constraints. CGTA, 32(3):173-187, 2005.
9. CityRail network map. Web page: http://www.cityrail.info/networkmaps/ mainmap.jsp (Accessed 6th Sept 2006).
10. D. Douglas and T. Peucker. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer 10(2):112-122, 1973.
11. D. Eu and G. T. Toussaint. On Approximating Polygonal Curves in Two and Three Dimensions. CVGIP: Graphical Model and Image Processing, 56(3):231-246, 1994.
12. C. Friedrich. jjGraph. Personal communication.
13. M. T. Goodrich. Efficient piecewise-linear function approximation using the uniform metric. Discrete & Computational Geometry, 14:445-462, 1995.
14. J. Gudmundsson, M. van Kreveld and D. Merrick. Schematisation of Tree Drawings. Submitted to Graph Drawing, June 2006.
15. J. Gudmundsson, G. Narasimhan and M. H. M. Smid. Distance-Preserving Approximations of Polygonal Paths. To appear in CGTA, 2006.
16. L. J. Guibas, J. Hershberger, J. S. B. Mitchell and J. Snoeyink. Approximating Polygons and Subdivisions with Minimum Link Paths. IJCGA, 3(4):383-415, 1993.
17. J. Hershberger and J. Snoeyink. Cartographic line simplification and polygon CSG formulae in O(n log* n) time. Computational Geometry - Theory & Applications, 11(3-4):175-185, 1998.
18. S.-H. Hong, D. Merrick, and H. A. D. do Nascimento. The metro map layout problem. In Proc. Graph Drawing 2004, p. 482-491, 2005.
19. H. Imai and M. Iri. Computational-geometric methods for polygonal approximations of a curve. Comp. Vision, Graphics and Image Processing, 36:31-41, 1986.
20. H. Imai and M. Iri. An optimal algorithm for approximating a piecewise linear function. Journal of Information Processing, 9(3):159-162, 1986.
21. H. Imai and M. Iri. Polygonal approximations of a curve-formulations and algorithms. In Computational Morphology, G. T. Toussaint (ed.), North-Holland, Amsterdam, 1988.
22. London Underground network map. Web page: http://www.tfl.gov.uk/tube/ maps/ (Accessed 6th Sept 2006).
23. A. Melkman and J. O'Rourke. On polygonal chain approximation. In Computational Morphology, G. T. Toussaint (ed.), North-Holland, Amsterdam, 1988.
24. D. Merrick and J. Gudmundsson. Increasing the readability of graph drawings with centrality-based scaling. In Proc. APVIS 2006, p. 67-76, 2006.
25. D. Merrick and J. Gudmundsson. C-Directed Path Simplification for Metro Map Layout, http://www.dmist.net/metromap.pdf (Accessed 6th Sept 2006).
26. G. Neyer. Line simplification with restricted orientations. In Proc. 6th International Workshop on Algorithms and Data Structures, p. 13-24, 1999.
27. M. Nöllenburg and A. Wolff. A mixed-integer program for drawing high-quality metro maps. In Proc. 13th International Symposium on Graph Drawing, 2005.
28. J. Stott and P. Rodgers. Metro map layout using multicriteria optimization. In Proc. 8th Interational Conference on Information Visualisation, p. 355-362, 2004.
29. G. T. Toussaint. On the Complexity of Approximating Polygonal Curves in the Plane. In Proc. of the International Symposium on Robotics and Automation (IASTED), pages 311-318, 1985.