Article

A Fast and Simple Heuristic for Metro Map Path Simplification

Authors:

Tim Dwyer,

Nathan Hurst,

Damian MerrickAuthors Info & Claims

ISVC '08: Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II

Pages 22 - 30

https://doi.org/10.1007/978-3-540-89646-3_3

Published: 01 December 2008 Publication History

Abstract

We give a heuristic for simplifying a path defined by a given sequence of points. The heuristic seeks to fit the points with a set of line segments aligned with a limited set of possible directions. Such "schematic path simplification" has application in automatically drawing simplified metro maps from geographic data. We show that a simple version of our algorithm produces reasonable results against real-world data and runs in linear time with respect to the number of points (assuming a small fixed number of possible directions). We then give some refinements to the algorithm which may improve the quality of the results but which significantly increase the worst-case time complexity.

References

[1]

Hong, S.H.,Merrick, D., do Nascimento, H.A.D.: The metro map layout problem. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 482-491. Springer, Heidelberg (2004).

Crossref

Google Scholar

[2]

Nöllenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 321-333. Springer, Heidelberg (2006).

Crossref

Google Scholar

[3]

Stott, J., Rodgers, P.: Metro map layout using multicriteria optimization. In: Proceedings of the 8th International Conference on Information Visualisation (IV 2004), pp. 355-362. IEEE Computer Society, Los Alamitos (2004).

Crossref

Google Scholar

[4]

Burkhard, R., Meier, M., Rodgers, P., Smis, M., Stott, J.: Knowledge visualization: a comparative study between project tube maps and gantt charts. In: Tochtermann, K., Maurer, H. (eds.) Proceedings of the 5th International Conference on Knowledge Management, pp. 388-395. Know-Center, Austria (2005).

Google Scholar

[5]

Hahn, W.C., Weinberg, R.A.: A subway map of cancer pathways. Nature Reviews Cancer 2 (2002).

Google Scholar

[6]

Nesbitt, K.V.: Getting to more abstract places using the metro map metaphor. In: Proceedings of the 8th International Conference on Information Visualisation, pp. 488-493 (2004).

Crossref

Google Scholar

[7]

Merrick, D., Gudmunsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 258-269. Springer, Heidelberg (2007).

Crossref

Google Scholar

[8]

Dwyer, T., Koren, Y., Marriott, K.: Stress majorization with orthogonal ordering constraints. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 141-152. Springer, Heidelberg (2006).

Crossref

Google Scholar

[9]

Neyer, G.: Line simplification with restricted orientations. In: Proceedings of the 6th International Workshop on Algorithms and Data Structures, pp. 13-24 (1999).

Crossref

Google Scholar

[10]

Alt, H., Godau, M.: Computing the fréchet distance between two polygonal curves. International Journal of Computational Geometry and Applications 5, 75-91 (1995).

Google Scholar

[11]

Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, Amsterdam (1999).

Crossref

Google Scholar

Cited By

View all

Berio DLeymarie FAsente PEchevarria J(2022)StrokeStyles: Stroke-based Segmentation and Stylization of FontsACM Transactions on Graphics10.1145/350524641:3(1-21)Online publication date: 28-Apr-2022
https://dl.acm.org/doi/10.1145/3505246
Wu HSpagnuolo MĎurikovič R(2016)Focus+context metro map layout and annotationProceedings of the 32nd Spring Conference on Computer Graphics10.1145/2948628.2948642(41-47)Online publication date: 27-Apr-2016
https://dl.acm.org/doi/10.1145/2948628.2948642

A Fast and Simple Heuristic for Metro Map Path Simplification
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies

Recommendations

Path simplification for metro map layout
GD'06: Proceedings of the 14th international conference on Graph drawing

We investigate the problem of creating simplified representations of polygonal paths. Specifically, we look at a path simplification problem in which line segments of a simplification are required to conform with a restricted set of directions C. An ...
A Hyper-Heuristic Using GRASP with Path-Relinking: A Case Study of the Nurse Rostering Problem

The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic ...
A heuristic homotopic path simplification algorithm
ICCSA'11: Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III

We study the well-known problem of approximating a polygonal path P by a coarse one, whose vertices are a subset of the vertices of P. In this problem, for a given error, the goal is to find a path with the minimum number of vertices while preserving ...

Comments

Information & Contributors

Information

Published In

ISVC '08: Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II

December 2008

1195 pages

ISBN:9783540896456

Editors:
George Bebis
Department of Computer Science and Engineering, University of Nevada, Reno, USA
,
Richard Boyle
NASA Ames Research Center, Moffett Field, USA
,
Bahram Parvin
Lawrence Berkeley National Laboratory, Berkeley, USA
,
Darko Koracin
Desert Research Institute, Reno, USA
,
Paolo Remagnino
Digital Image Research Center, Kingston University, London, UK
,
Fatih Porikli
Mitsubishi Electric Research Laboratories, Cambridge P.O. Box 02139
,
Jörg Peters
Computer and Information Science and Engineering, University of Florida, Gainsville, USA FL 32611-6120
,
James Klosowski
IBM T.J. Watson Research Center, Hawthorne, USA NY 10532
,
Laura Arns
128 Memorial Mall, Stewart B001, West Lafayette, USA IN 47907
,
Yu Ka Chun
Denver Museum of Nature and Space, USA CO 80205
,
Theresa-Marie Rhyne
Departmen of Computer Science,, NC State University, Raleigh, USA NC 27695-8206
,
Laura Monroe
Los Alamos National Labs, Los Alamos, USA NM 87545

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 December 2008

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Berio DLeymarie FAsente PEchevarria J(2022)StrokeStyles: Stroke-based Segmentation and Stylization of FontsACM Transactions on Graphics10.1145/350524641:3(1-21)Online publication date: 28-Apr-2022
https://dl.acm.org/doi/10.1145/3505246
Wu HSpagnuolo MĎurikovič R(2016)Focus+context metro map layout and annotationProceedings of the 32nd Spring Conference on Computer Graphics10.1145/2948628.2948642(41-47)Online publication date: 27-Apr-2016
https://dl.acm.org/doi/10.1145/2948628.2948642

Abstract

References

Cited By

Recommendations

Path simplification for metro map layout

A Hyper-Heuristic Using GRASP with Path-Relinking: A Case Study of the Nurse Rostering Problem

A heuristic homotopic path simplification algorithm

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations