Abstract
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the drawing must lie with in a given distance r of each original point p ∞ S, and an objective function counting the number of bends must be minimised. We propose five versions of this problem using different objective functions, and algorithms to solve them. This work has potential applications in geographic map schematisation and metro map layout. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Gudmundsson, J., Van Kreveld, M., & Merrick, D. (2007). Schematisation of tree drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4372 LNCS, pp. 66–76). Springer Verlag. https://doi.org/10.1007/978-3-540-70904-6_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
