General rooted tree drawing algorithm

Xiaoshu Hang; He Huang; Fanlun Xiong

doi:10.1117/12.477110

31 July 2002 General rooted tree drawing algorithm

Xiaoshu Hang, He Huang, Fanlun Xiong

Proceedings Volume 4875, Second International Conference on Image and Graphics; (2002) https://doi.org/10.1117/12.477110
Event: Second International Conference on Image and Graphics, 2002, Hefei, China

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.

Citation Download Citation

Xiaoshu Hang, He Huang, and Fanlun Xiong "General rooted tree drawing algorithm", Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); https://doi.org/10.1117/12.477110

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available