An Algorithm for Drawing Binary Trees with Less Bends

적은 굴곡점을 가진 이진트리를 그리는 알고리즘

  • Published : 2000.02.15

Abstract

In this paper we present polyline upward order preserving grid drawing algorithm for binary trees with n vertices that achieves 0(n) height, 0(log n) width and 0(nlog n) area, matching the previously known results, and that reduces the number of bends to 0(n/log n) from 0(n)

본 논문에서는 n개의 노드로 이루어진 이진트리를 평면에 그리는 한 방법인 평면 다각선 상향 순서보존 그리드 방법을 이용하여 높이 0(n), 폭 0(log n), 면적 O(n log n)은 기존의 결과와 같게 유지하면서, 굴곡점의 수를 (n)에서 (n/logn)으로 줄이는 알고리즘을 제시한다.

Keywords

References

  1. T. Chan, M.T. Goodrich, S.R. Kosaraju, and R. Tamassia, Optimizing area and aspect ratio in staright-line orthogonal tree drawings, Proc. Graph Drawing '96, Lecture Notes in Computer Science, vol. 1190, pp. 63-75, 1997
  2. P. Crescenzi, G. Di Battista, and A. Piperno, A note on optimal area algorithms for upward drawings of binary trees, Computational Geometry: Theory and Applications, vol. 2, pp. 187--200, 1992 https://doi.org/10.1016/0925-7721(92)90021-J
  3. P. Crescenzi, P. Penna and A. Piperno, Linear area upward drawings of AVL trees, Computational Geometry: Theory and Applications, Volume 9, pp. 25-42, 1998 https://doi.org/10.1016/S0925-7721(97)00013-8
  4. A. Garg, M.T. Goodrich, and R. Tamassia, Area-efficient upward tree drawings, Proc. 9th ACM Symposium on Computational Geometry, pp. 359--368, 1993 https://doi.org/10.1145/160985.161165
  5. S.K. Kim, Logarithmic width, linear area upward drawing of AVL trees, Information Processing Letters, vol. 63, pp. 303--307, 1997 https://doi.org/10.1016/S0020-0190(97)00137-3
  6. C.S. Shin, S.K. Kim, and K.Y. Chwa, Area-efficient algorithms for upward straight-line tree drawings, Proc. 2nd International Conference on Computing and Combinatorics, COCOON '96, Lecture Notes in Computer Science, vol. 1090, pp. 106--116, 1996