الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 281 |  |  |
| | | from | 281 | | |
Abstract
Graph drawing (also known as graph visualization) tackles the problem of representing graphs on a visual medium such as computer screen, printer etc. Many applications such as software engineering, data base design, project planning, VLSI design, multimedia etc., have data structures that can be represented as graphs. With the ever increasing complexity of these and new applications, and availability of hardware supporting visualization, the area of graph drawing is increasing getting more attention from both practitioners and researchers.
In a typical drawing of a graph, the nodes are represented as symbols such as circles, dots or boxes, etc., and the edges are drawn as continuous curves joining their end points. Often, the edges are simply drawn as (straight- or poly-) lines joining their end points. The goal of the research in graph drawing is to develop techniques for constructing good drawings of the input graphs. Informally speaking, a drawing is consider “good” if it is able to communicate effectively and clearly, the information being displayed in the drawing. Several desirable properties of a good drawing, that have been identified are: small area, minimum edge crossing, large angles between edges, symmetry, small number of edges-bends, upwardness, clustering or aligning of related nodes etc.
In this thesis, we have addressed the problem of constructing tree drawings that exhibit some of these properties, and have presented several new techniques that provide answers to these problems. The problems we have considered relate to the following drawings:
The area requirements of visibility representation of rooted tree using Upward Drawing.
The area requirements of visibility representations of rooted tree using Leftward with Rightward Drawing.
The area requirements of rooted tree using Box Drawing.
The area requirements of tree using Orthogonal Drawing