TWO TREE DRAWING CONVENTIONS

DOI10.1142/S0218195993000099zbMath0850.68316MaRDI QIDQ3136721

Tao Lin, Peter Eades, Xuemin Lin

Publication date: 24 October 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Proximity drawings in polynomial area and volume, On the approximability of two tree drawing conventions, The realization problem for Euclidean minimum spanning trees is NP-hard, A note on parallel algorithms for optimal h-v drawings of binary trees, Three-dimensional graph drawing, Minimum-width grid drawings of plane graphs