Path simplification for metro map layout

Authors:
Damian Merrick;Joachim Gudmundsson
Affiliations:
School of Information Technologies, University of Sydney, Australia and National ICT Australia, Sydney, Australia;National ICT Australia, Sydney, Australia
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 13
Cited 12

Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
Measuring the resemblance of polygonal curves

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On approximating polygonal curves in two and three dimensions

CVGIP: Graphical Models and Image Processing
Cartographic line simplification and polygon CSG formulæ in O(n log* n) time

WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Metro Map Layout Using Multicriteria Optimization

IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Increasing the readability of graph drawings with centrality-based scaling

APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Area-preserving approximations of polygonal paths

Journal of Discrete Algorithms
Distance-preserving approximations of polygonal paths

Computational Geometry: Theory and Applications
Schematization of networks

Computational Geometry: Theory and Applications
Polygonal path simplification with angle constraints

Computational Geometry: Theory and Applications
Schematisation of tree drawings

GD'06 Proceedings of the 14th 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
The metro map layout problem

GD'04 Proceedings of the 12th international conference on Graph Drawing

An ILP for the metro-line crossing problem

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A Fast and Simple Heuristic for Metro Map Path Simplification

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
On the Hardness of Orthogonal-Order Preserving Graph Drawing

Graph Drawing
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

Graph Drawing
Schematisation of tree drawings

GD'06 Proceedings of the 14th international conference on Graph drawing
An automatic generation of schematic maps to display flight routes for air traffic controllers: structure and color optimization

Proceedings of the International Conference on Advanced Visual Interfaces
On d-regular schematization of embedded paths

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Path schematization for route sketches

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Travel-Route-Centered Metro Map Layout and Annotation

Computer Graphics Forum
Fast and simple approach for polygon schematization

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Homotopic C -oriented routing

GD'12 Proceedings of the 20th international conference on Graph Drawing
On d-regular schematization of embedded paths

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 algorithm is given to compute such simplified paths in O(|C|3n2) time, where n is the number of vertices in the original path. This result is extended to produce an algorithm for graphs induced by multiple intersecting paths. The algorithm is applied to construct schematised representations of real world railway networks, in the style of metro maps.