Path simplification for metro map layout

Path simplification for metro map layout (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Damian Merrick , Joachim Gudmundsson

Venue:	Proc. 14th Internat. Sympos. Graph Drawing (GD’06), volume 4372 of Lecture
Citations:	6 - 1 self

BibTeX

@INPROCEEDINGS{Merrick06pathsimplification,
    author = {Damian Merrick and Joachim Gudmundsson},
    title = {Path simplification for metro map layout},
    booktitle = {Proc. 14th Internat. Sympos. Graph Drawing (GD’06), volume 4372 of Lecture},
    year = {2006},
    publisher = {Springer}
}

Bookmark

OpenURL

Abstract

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 | 3 n 2) 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. 1

Citations

358	Algorithms for the reductions of the number of points required to represent a digitized line or its caricature - Douglas, Peucker - 1973
55	Approximating polygons and subdivisions with minimum link paths - Guibas, Hershberger, et al. - 1991
54	On approximation of polygonal curves with minimum number of line segments or minimum error - Chan, Chin - 1992
39	M.: Computational-geometric methods for polygonal approximations of a curve - Imai, Iri - 1986
34	Polygonal approximations of a curve-formulations and algorithms - Imai, Iri - 1988
33	Efficient piecewise-linear function approximation using the uniform metric - Goodrich - 1994
33	On polygonal chain approximation - Melkman, O’Rourke
31	An optimal algorithm for approximating a piecewise linear function - Imai, Iri - 1987
29	Efficient algorithms for approximating polygonal chains - Agarwal, Varadarajan
26	Measuring the resemblance of polygonal curves - Alt, Godau - 1992
21	Efficiently approximating polygonal paths in three and higher dimensions - Barequet, Chen, et al.
20	Space-efficient algorithms for approximating polygonal curves in two dimensional space - Chen, Daescu - 1998
16	Cartographic line simplification and polygon CSG formulae in time - Hershberger, Snoeyink - 1997
16	On the complexity of approximating polygonal curves in the plane, in - Toussaint - 1985
14	The Metro Map Layout Problem - Hong, Merrick, et al. - 2004
12	A.: A Mixed-Integer Program for Drawing High-Quality Metro Maps. Graph Drawing 3843 - Nöllenburg, Wolff - 2006
10	Metro Map Layout Using Multicriteria Optimization - Stott, Rodgers - 2004
8	Areapreserving approximations of polygonal paths - Bose, Cabello, et al.
8	Line simplification with restricted orientations - Neyer - 1999
6	M.: Schematization of networks - Cabello, Deberg, et al. - 2005
6	Distance-preserving approximations of polygonal paths - Gudmundsson, Narasimhan, et al.
4	Polygonal path simplification with angle constraints - Chen, Daescu, et al. - 2005
2	On Approximating - Eu, Toussaint - 1994
2	Increasing the readability of graph drawings with centrality-based scaling - Merrick, Gudmundsson
2	C-Directed Path Simplification for Metro Map Layout. http://www.dmist.net/metromap.pdf - Merrick, Gudmundsson - 2006
1	Schematisation of Tree Drawings - Gudmundsson, Kreveld, et al. - 2006
1	Underground network map. Web page: http://www.tfl.gov.uk/tube/maps - London - 2006