M Nollenburg, A Wolff - IEEE transactions on visualization and …, 2010 - ieeexplore.ieee.org
Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualization to …
This paper describes an automatic mechanism for drawing metro maps. We apply multicriteria optimization to find effective placement of stations with a good line layout and to …
A Wolff - Informatik-Forschung und Entwicklung, 2007 - Springer
This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such as …
M Nöllenburg - Schematic Mapping Workshop, 2014 - i11www.iti.kit.edu
We give a comprehensive overview of the state of the art in automated metro map layout. A large number of algorithms for computing metro maps have been developed over the last 10 …
M Nöllenburg, A Wolff - International Symposium on Graph Drawing, 2005 - Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (eg …
Schematic transit maps (often called “metro maps” in the literature) are important to produce comprehensible visualizations of complex public transit networks. In this work, we …
T Batik, S Terziadis, YS Wang… - Computer Graphics …, 2022 - Wiley Online Library
Metro or transit maps, are schematic representations of transit networks to facilitate effective route‐finding. These maps are often advertised on a web page or pamphlet highlighting …
Schematic drawings showing railway tracks and equipment are commonly used to visualize railway operations and to communicate system specifications and construction blueprints …
M Asquith, J Gudmundsson, D Merrick - CATS, 2008 - researchgate.net
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G=(V, E)(eg the railroad network) and a set H of paths …