A tree drawing algorithm that places child nodes symmetrically around their parent node. Nodes at the lowest level are arranged directly in a circle around their parent. At the upper level, the already arranged nodes form branches that are arranged in a circle around the new parent node. The algorithm is recursively repeated till the highest level is reached.
The following tables list the members exposed by the FractalDrawing type.
Public Constructors| Name | Description | |
|---|---|---|
 |
|
Public Methods| Name | Description | |
|---|---|---|
|
|
See Also
