Results

**1 - 2**of**2**### Rectilinear Graphs and Angular Solutions

, 2003

"... In this note we show that a planar graph with angular resolution at least #/2 can be drawn with all angles an integer multiple of #/2, that is, in a rectilinear manner. Moreover, ..."

Abstract
- Add to MetaCart

In this note we show that a planar graph with angular resolution at least #/2 can be drawn with all angles an integer multiple of #/2, that is, in a rectilinear manner. Moreover,

### A NEW ALGORITHM FOR COMPACT BOX-DRAWING OF TREES

"... Abstract: Several researchers has discussed the Box-drawing of trees. In this paper the more recent algorithms are investigated and a new one has been introduced, in which each cell is drawn by a square box, no two boxes overlap each other, all boxes corresponding to siblings cells of the tree have ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract: Several researchers has discussed the Box-drawing of trees. In this paper the more recent algorithms are investigated and a new one has been introduced, in which each cell is drawn by a square box, no two boxes overlap each other, all boxes corresponding to siblings cells of the tree have the same x-coordinate at their left and right sides, and a parent cell is drawn nearly at the middle of its children. A Box-drawing of a tree is compact if it attains the minimum possible rectangle area enclosing the drawing. Our new algorithm is a linear time algorithm for finding a compact Box-drawing of a tree with area equal ( 2l −1) ( 2h