High-performance tidy trees visualization : vimarsana.com

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.

Related Keywords

Berlin , Germany , Heidelberg , Baden Wüberg , , Transactions On Software Engineering , Bill Mill , Aesthetic Rule , Macbook Pro , Tidy Lib , Software Engineering , Linear Time , Graph Drawing , Presentable Trees ,