Algorithms for Drawing Binary Trees in the Plane
In this paper, we present several algorithms for drawing binary trees in the plane under various measures such as area, aspect ratio, the sum of edge lengths, and the number of bends per edge. (C) 1998 Published by Elsevier Science B.V. All rights reserved.
- Publisher
- Elsevier Science Bv
- Issue Date
- 1998-01
- Language
- English
- Article Type
- Article
- Citation
INFORMATION PROCESSING LETTERS, v.66, no.3, pp.133 - 139
- ISSN
- 0020-0190
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 3 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.