A general rooted tree drawing algorithm
conference contribution
posted on 2002-01-01, 00:00 authored by Xiaoshu Hang, H Huang, F XiongA general rooted tree drawing algorithm is designed in this paper. It satisfies the basic aesthetic criteria and can be well applied to binary trees. Given an area, any complex tree can be drawn within the area in users' favorite styles. The algorithm is efficient with O(LxNxlogN) time complexity and self-adaptive as well.
History
Title of proceedings
Second International Conference on Image and GraphicsEvent
International Conference on Image and Graphics (2nd : 2002 : Hefei, China)Series
Proceedings of SPIE--the International Society for Optical Engineering ; v. 4875.Pagination
1022 - 1029Publisher
SPIE, International Society for Optical EngineeringLocation
Hefei, ChinaPlace of publication
Bellingham, WashPublisher DOI
Start date
2002-08-16End date
2002-08-18ISBN-13
9780819446565ISBN-10
0819446564Language
engPublication classification
E1 Full written paper - refereedEditor/Contributor(s)
W SuiUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC