Drawing complete binary trees inside rectilinear polygons

References

• Bagheri , A. and Razzazi , M. 2004 . How to draw free trees inside bounded rectilinear polygons . Int. J. Comput. Math. , 81 ( 11 ) : 1329 – 1339 .
   Web of Science ®Google Scholar
• Bagheri , A. and Razzazi , M. 2007 . “ Planar embeddability of trees inside simple polygons is NP-hard ” . Tehran, , Iran : Computer Engineering and IT Department, Amirkabir University of Technology . Tech. Rep
   Google Scholar
• Battista , G. D. , Eades , P. , Tamassia , R. and Tollis , I. G. 1994 . Algorithms for drawing graphs: An annotated bibliography . Comput. Geom. Theory Appl. , 4 ( 5 ) : 235 – 282 .
   Web of Science ®Google Scholar
• Battista , G. D. , Eades , P. , Tamassia , R. and Tollis , I. G. 1999 . Graph Drawing: Algorithms for the Visualization of Graphs , Upper Saddle River, NJ : Prentice Hall .
   Google Scholar
• Bohringer , K. F. , Donald , B. R. and Halperin , D. 1999 . On the area bisectors of a polygon . Discrete Comput. Geom. , 22 : 269 – 285 .
   Google Scholar
• Bose , P. , McAllister , M. and Snoeyink , J. 1997 . Optimal algorithms to embed trees in a point set . J. Graph Algorithms Appl. , 1 ( 2 ) : 1 – 15 .
   Google Scholar
• Burkis , J. Clock tree synthesis for high performance ASICs . Proceedings of the 4th IEEE International Conference on ASIC . pp. 981 – 984 .
   Google Scholar
• Chan , T. M. A near-linear area bound for drawing binary trees . Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms . Baltimore, Maryland, United States. pp. 161 – 168 .
   Google Scholar
• Chazelle , B. 1990 . Triangulating a simple polygon in linear time . Discrete Comput. Geom. , 6 ( 5 ) : 485 – 524 .
   Google Scholar
• Coleman , M. and Parker , D. S. 1996 . Aesthetics-based graph layout for human consumption . Softw. Practice Experience , 26 ( 12 ) : 1415 – 1438 .
   Google Scholar
• Cormen , T. H. , Leiserson , C. E. , Rivest , R. L. and Stein , C. Introduction to Algorithms , 2 , Cambridge, MA : MIT Press .
   Google Scholar
• Crescenzi , P. and Penna , P. 1997 . “ Minimum-area h-v drawings of complete binary trees ” . Vol. 1353 , 371 – 382 . Berlin/Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
   Google Scholar
• Formann , M. and Wagner , F. 1991 . “ The VLSI layout problem in various embedding models ” . Vol. 484 , 130 – 139 . Berlin/Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
   Google Scholar
• Garey , M. R. and Johnson , D. S. 1983 . Crossing number is NP-complete . SIAM J. Algebr. Discrete Methods , 4 ( 3 ) : 312 – 316 .
   Google Scholar
• Garg , A. and Rusu , A. 2004 . Straight-line drawings of binary trees with linear area and arbitrary aspect ratio . J. Graph Algorithms Appl. , 8 ( 2 ) : 135 – 160 .
   Google Scholar
• Guardia , R. and Hurtado , F. On the equipartitions of convex bodies and convex polygons . Proceedings 16th European Workshop on Computational Geometry . pp. 47 – 50 .
   Google Scholar
• Junger , M. and Mutzel , P. 2003 . Graph Drawing Software , Edited by: Junger , M. and Mutzel , P. Berlin/Heidelberg : Springer-Verlag .
   Google Scholar
• Kaufmann , M. and Wagner , D. 2001 . Drawing Graphs Methods and Models , Edited by: Kaufmann , M. and Wagner , D. Vol. 2025 , Berlin/Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
   Google Scholar
• Koutsoupias , E. , Papadimitriou , C. H. and Sideri , M. On the optimal bisection of a polygon, Proceedings of the Sixth Annual Symposium on Computational Geometry . Berkley, California, United States. pp. 198 – 202 .
   Google Scholar
• Nishizeki , T. and Rahman , Md S. 2004 . Planar Graph Drawing , Singapore : World Scientific .
   Google Scholar
• O'Rourke , J. 1983 . An alternative proof of the rectilinear art gallery theorem . J. Geom. , 21 : 118 – 130 .
   Google Scholar
• Penna , P. 2002 . On the approximability of two tree drawing conventions . Inf. Process. Lett. , 82 ( 5 ) : 237 – 242 .
   Google Scholar
• Shermer , T. C. 1992 . A linear algorithm for bisecting a polygon . Inf. Process. Lett. , 41 ( 3 ) : 135 – 140 .
   Google Scholar
• Sugiyama , K. 2002 . Graph Drawing and Applications for Software and Knowledge Engineers , Singapore : World Scientific .
   Google Scholar
• Tollis , I. G. and Patrignani , M. Proceedings of the 16th International Symposium on Graph Drawing . Edited by: Tollis , I. G. and Patrignani , M. Vol. 5417 , Berlin/Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
   Google Scholar
• Trevisan , L. 1996 . A note on minimum-area upward drawing of complete and Fibonacci trees . Inf. Process. Lett. , 57 ( 5 ) : 231 – 236 .
   Google Scholar
• Zheng , J. 2006 . “ Improvements of tribe genetic drawing algorithm ” . Tao-yuan, , Taiwan : Computer Science and Information Engineering, National Central University . Master's Thesis
   Google Scholar