Zxch3n's Blog personal blog
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.
- Points
- 231
- HN comments
- 21
- Submissions
- 1
- Cited by
- 0 commenters
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| May 18, 2023 | High-performance tidy trees visualization (2022) by czx111331 | 231 | 21 |
