Rectangle packing algorithm for tree and graph visualization
Robert Recorde, Monday July 27th at 3pm
Abstract This talk introduces the speaker’s techniques on space-filling tree and network visualization. The former part of the talk introduces a tree visualization technique which represents hierarchy of the tree structure as nested rectangular regions. The latter part of the talk introduces a network visualization technique which clusters nodes according to their categories and connectivity, and then displays the clusters as rectangular regions. Both techniques are based on a rectangle packing algorithm which efficiently places the rectangular regions onto a display space. This talk also introduces several applications of the tree and network visualization techniques.
Biography Professor Takayuki Itoh is a full professor of the department of information sciences in Ochanomizu University, Japan since 2011. His research interest includes visualization, computer graphics, and multimedia. He is a vice director of the society for art and science in Japan, and a track chair of ACM Symposium on Applied Computing, Multimedia and Visualization track.
Takayuki Itoh has received his B.S., M.S., and Ph.D. degrees from Waseda University in 1990, 1992, and 1997, respectively. He has been a researcher at Tokyo Research Laboratory of IBM Japan during 1992 to 2005. He was also a visiting researcher at Carnegie Mellon University in 2000, and Kyoto University during 2003 to 2005. He has been an associate professor in Ochanomizu University since 2005, and a full professor since 2011.