A Space-Filling Technique for the Visualization of Planar st-graph

Abstract: Graphs currently attract an increasing number of computer scientists due to their widely adoptions in different areas. However, when people perform graph drawing, one of the most critical issues they need to concern is atheistics, i.e., to make the graph more suitable for human perceptions. In this work, we will aim at exploring one specific kind of graph ''planar st-graphs'' with space-filling technique in Info Vis area. We would cover edge crossing elimination, layer assignment, graph drawing algorithms, and new development of space-filling technique in planar st-graphs drawing etc. The final aim of this project is to develop a new algorithm to draw planar st-graphs based on a space-filling visualization approach with minimum edge crossings and maximum space usage.