aDepartment of Mathematics, Institute for Mathematics, Physics and Mechanics, Slovenia
bDepartment of Computer Science, TU Eindhoven, The Netherlands
cInstitute of Information and Computing Sciences, Utrecht University, The Netherlands
Abstract:
We study the problem of computing schematized versions of network maps, like railroad or highway maps. Every path of the schematized map has two or three links with restricted orientations, and the schematized map must be topologically equivalent to the input map. Our approach can handle several types of schematizations, and certain additional constraints can be added, such as a minimum vertical distance between two paths. Our algorithm runs in O(nlogn) time, and experimental results showing the quality of the output are given.