Rapid Multipole Graph Drawing on the GPU
Graph Drawing
| Hi-index | 0.00 |
Several conventions for drawing rooted trees are discussed: classical drawings, tip-over drawings, inclusion drawings, and h-v drawings. In each convention, a number of algorithms and complexity results are available. For free trees (no specific root), algorithms are mostly drawn from folklore. Radial drawings, spring drawings, and orthogonal drawings are discussed.