Speaker

Dr.Sheung-Hung POON，National Tsing Hua University

　　Title

Non-Planar Square-Orthogonal Drawing with Few-Bend Edges

　　Time

　　Venue

N602

　　Abstract

We investigate square-orthogonal drawings of non-planar graphs with vertices represented as unit grid squares. We present quadratic-time algorithms to construct the square-orthogonal drawings of 5-graphs, 6-graphs, and 8-graphs such that each edge in the drawing contains at most two, two, and three bends, respectively. In particular, the novel analysis method we use to split a vertex so as to build some specific propagation channels in our algorithms is an interesting technique and may be of independent interest. Moreover, we show that the decision problem of determining whether an 8-graph has a square-orthogonal drawing without edge-bends is NP-complete.

　　Affiliation

Sheung-Hung Poon received his Ph.D. degrees in Department of Computer Science from Hong Kong University of Science & Technology, Hong Kong, in 2004.He had been a postdoc researcher in Algorithm Group at Technical University of Eindhoven, The Netherlands, for two and a half years. Since 2007, he has been an assistant professor in Department of Computer Science at National Tsing Hua University, Taiwan. His research interests include computational geometry, graph drawing, geographic visualization, and graph algorithms.