LGES: A Large Graph Embedding System

Abstract

Many convenient graph drawing tools have been developed to visualize the relational information among the large massive data sets. This paper presents a new system for drawing large undirected graphs in the two-dimensional and three-dimensional space, called LGES. It employs a fast novel algorithm to beautify the layouts, which adopts the multi-level method as the framework of the algorithm, and uses the improved force-directed algorithm to refine the single-level layouts. Experiments prove its high performance and nice results. It takes around 5 seconds to draw 10,000 vertex graphs in the two- dimensional space and around 40 seconds in the three- dimensional space. Moreover, the independent components provided by the LGES system are attractive for its further development and application.