Angle and Distance Constraints on Tree Drawings
We consider planar drawings of trees that must satisfy constraints on the angles between edges incident to a common vertex and on the distances between adjacent vertices. These requirements arise naturally in many applications such as drawing phylogenetic trees or route maps. For straight-line drawings, either class of constraints is always realizable, whereas their combination is not in general. We show that straight-line realizability can be tested in linear time, and give an algorithm that produces drawing satisfying both groups of constraints together in a model where edges are represented as polylines with at most two bends per edge or as continuously differentiable curves.
- 2.Brandes, U., Shubina, G., Tamassia, R.: Improving angular resolution in visualizations of geographic networks. In: Data Visualization: Proc. 2nd Joint EUROGRAPHICS and IEEE TCVG Symp. Visualization, VisSym, pp. 23–33. Springer, 29–30 (2000)Google Scholar
- 6.Finkel, B., Tamassia, R.: Curvilinear Graph Drawing Using the Force-Directed Method. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 448–453. Springer, Heidelberg (2005)Google Scholar
- 7.Garg, A.: On drawing angle graphs. In: Tamassia, R., Tollis, I(Y.) G. (eds.) GD 1994. LNCS, vol. 894, pp. 84–95. Springer, Heidelberg (1995)Google Scholar
- 9.Melançon, G., Hermann, I.: Circular drawing of rooted trees. Technical report 9817, Reports of the Center for Mathematics and Computer Science (1998)Google Scholar