Share Email Print
cover

Proceedings Paper

General rooted tree drawing algorithm
Author(s): Xiaoshu Hang; He Huang; Fanlun Xiong
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A 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.

Paper Details

Date Published: 31 July 2002
PDF: 8 pages
Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); doi: 10.1117/12.477110
Show Author Affiliations
Xiaoshu Hang, Deakin Univ. (China)
He Huang, Hefei Institute of Intelligent Machines (China)
Fanlun Xiong, Hefei Institute of Intelligent Machines (China)


Published in SPIE Proceedings Vol. 4875:
Second International Conference on Image and Graphics
Wei Sui, Editor(s)

© SPIE. Terms of Use
Back to Top