Drawing a tree on parallel lines
โ Scribed by R. Hirabayashi; Y.T. Ikebe; K. Iwamura; T. Nakayama
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 336 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
We consider a problem of drawing a tree on parallel lines. In this problem we are given a tree and an infinite number of parallel lines in the plane. The object is to draw the tree so that (i) each vertex is placed on one of the given parallel lines, (ii) no two edges intersect, and (iii) the 'height' of each vertex is nondecreasing, while minimizing the total number of lines used. We show that this problem is solvable in time linear on the size of the tree, by presenting an algorithm wtlich solves it recursively. (~) 1999 Elsevier Science Ltd. All rights reserved.
๐ SIMILAR VOLUMES
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an NP-hard task, even when we restrict ourselves to binary trees. We provide a fully polynomial time approximation scheme f
How do you guard a man who passes off anonymous threats on his life as mere foolishness? In this new novel about the charming Inspector from the Bombay CID, Ganesh Ghote is faced with just such a perplexing situation. Sent to a remote part of India on the pretense of helping Judge Asif with his mem