论文信息 - A node‐positioning algorithm for general trees

A node‐positioning algorithm for general trees

Drawing a tree consists of two stages: determining the position of each node, and actually rendering the individuals nodes and interconnecting branches. The algorithm described in this paper is concerned with the first stage: given a list of nodes, an indication of the hierarchical relationship among them, and their shape and size, where should each node be positioned for optimal aesthetic effect?

John Q. Walker | John Q. Walker

[1] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[2] Niklaus Wirth,et al. Algorithms + Data Structures = Programs , 1976 .

[3] Richard E. Sweet,et al. Empirical estimates of program entropy , 1977 .

[4] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[5] Charles Wetherell,et al. Tidy Drawings of Trees , 1979, IEEE Transactions on Software Engineering.

[6] Jean G. Vaucher. Pretty‐printing of trees , 1980, Softw. Pract. Exp..

[7] Edward M. Reingold,et al. Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[8] Jon Louis Bentley. Programming pearls: data structures programs , 1983, CACM.

[9] Mikhail J. Atallah,et al. Fast Detection and Display of Symmetry in Trees , 1985 .

[10] J. J. Garcia-Luna-Aceves,et al. CCWS: A Computer-Based, Multimedia Information System , 1985, Computer.