A Fast and Simple Heuristic for Metro Map Path Simplification

  • Tim Dwyer
  • Nathan Hurst
  • Damian Merrick
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5359)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Tim Dwyer
    • 1
  • Nathan Hurst
    • 2
  • Damian Merrick
    • 3
  1. 1.Microsoft ResearchRedmondUSA
  2. 2.Adobe SystemsSan JoseUSA
  3. 3.XP SoftwareCanberraAustralia

Personalised recommendations