Data Structures and Algorithm Analysis in Java
Data Structures and Algorithm Analysis in Java
Line Simplification with Restricted Orientations
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Metro Map Layout Using Multicriteria Optimization
IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Getting to more Abstract Places using the Metro Map Metaphor
IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Path simplification for metro map layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Stress majorization with orthogonal ordering constraints
GD'05 Proceedings of the 13th international conference on Graph Drawing
A mixed-integer program for drawing high-quality metro maps
GD'05 Proceedings of the 13th international conference on Graph Drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
Travel-Route-Centered Metro Map Layout and Annotation
Computer Graphics Forum
| Hi-index | 0.00 |
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.