Document Details

Document Type : Article In Conference 
Document Title :
A New Algorithm for Compact Box-Drawing of Trees
خوارزمية جديدة لرسم الاشجار في مساحة محكمة
 
Subject : COMPUTER, MATHEMATICS AND STATISTICS 
Document Language : Arabic 
Abstract : Several researchers have discussed the Box-drawing of tree s. In this paper the more recent algorithms are investigated and a new one have been introdu ced , in which each cell is drawn by a square box, no two boxes overlap each other, all boxes corresponding to siblings cells of the tree have the same xcoordinate at their left and right sides , and a parent cell is drawn nearly at the middle of its children. A Box-drawing of a tree is compact if it attains the minimum possible rectangle area enclosing the drawing. Our new algorithm is a linear time algorithm for finding a compact Box-drawing of a tree with area equal (2/-1)(2h +1) where I is the number of leaves and h is the height of tree T. 
Conference Name : the second saudi science confernce 
Duration : From : 24محرم AH - To : 26محرم AH
From : 15مارس AD - To : 17مارس AD 
Publishing Year : 1425 AH
2004 AD 
Number Of Pages : 12 
Article Type : Article 
Added Date : Sunday, January 18, 2009 

Researchers

Researcher Name (Arabic)Researcher Name (English)Researcher TypeDr GradeEmail
أحمد علي رضوانRADWAN, N/A N/AInvestigator aaaradwaneg@yahoo.co.uk
عصام حليم حسينHOUSSIN, N/A N/AResearcher esamhh@yahoo.com

Files

File NameTypeDescription
 65.pdf pdf 

Back To Researches Page