4 ms·
There are some improvements in Buchheim et al: ; http://dirk.jivas.de/papers/buchheim02improving.pdf http://dirk.jivas.de/papers/buchheim02improving.pdf
by soegaard 11y ago
There are some improvements in Buchheim et al:
; http://dirk.jivas.de/papers/buchheim02improving.pdf http://dirk.jivas.de/papers/buchheim02improving.pdf
See also "Compact layout of Layered Trees".
Note that Bill Mill's blog post "Drawing Presentable Trees"
presents the algorithm in a very readable manner:
http://billmill.org/pymag-trees/
- mbostock 11y agoYep! This linear-time algorithm described by Buchheim et al. is used by d3.layout.tree: https://github.com/d3/d3-hierarchy/blob/master/src/tree.js https://github.com/d3/d3-hierarchy/blob/master/src/tree.js
- llimllib 11y agoI hadn't looked at that in forever! Glad somebody found it useful :) The layout is awful, so I just now limited the page width and centered the body, which should make it a bit more readable.