Schematisation of tree drawings

Authors:
Joachim Gudmundsson;Marc van Kreveld;Damian Merrick
Affiliations:
National ICT Australia, Sydney, Australia;Department of Computer Science, Utrecht University, The Netherlands;National ICT Australia, Sydney, Australia and School of Information Technologies, University of Sydney, Australia
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 8
Cited 1

Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Orthogonal graph drawing

Drawing graphs
Sketch-Driven Orthogonal Graph Drawing

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Metro Map Layout Using Multicriteria Optimization

IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Schematization of networks

Computational Geometry: Theory and Applications
Path simplification for metro map layout

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

Path simplification for metro map layout

GD'06 Proceedings of the 14th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

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 within 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.