Skip to main content
100%

Reingold–Tilford Tree

✓ Published0🌍 Public
Aaht
Last edited Jan 29, 2016
Created on Jan 29, 2016

The Reingold–Tilford tree displays a decision-tree hierarchy from the Flare class structure, with leaf nodes sized and colored by probability. It uses d3.layout.tree with d3.svg.diagonal to draw tidy layered nodes and curved links in SVG. Node circles encode leaf size via radius and churn probability via a linear color scale, while labels show feature splits and segment details.

AI-generated description

The tree layout implements the Reingold-Tilford algorithm for efficient, tidy arrangement of layered nodes. The depth of nodes is computed by distance from the root, leading to a ragged appearance. Radial orientations are also supported. Implementation based on work by Jeff Heer and Jason Davies using Buchheim et al.'s linear-time variant of the Reingold-Tilford algorithm. Data shows the Flare class hierarchy, also courtesy Jeff Heer.

Compare to this radial layout.

Similar vizzes