1
High-performance tidy trees visualization (2022)
This article introduces the algorithm to draw non-layered trees in linear time and re-layout partially when some nodes change in O(d) time, where d is the maximum depth of the changed node.
Zixuan Chen's Blog
Visit zxch3n.com → RSS feedOn Hacker News May 2023 – May 2023
This article introduces the algorithm to draw non-layered trees in linear time and re-layout partially when some nodes change in O(d) time, where d is the maximum depth of the changed node.