Efficient Barycenter Algorithm for Drawing Hierarchical Graphs with Minimum Edge Crossings

Graph Drawing is a branch of computer graphics that addresses the problem of constructing geometric representations of conceptual structures that are modeled by graphs. Crossing reduction is one of the crucial problems in drawing networks that are presented in a hierarchical manner which is solved by repeated layer-by-layer techniques or by global ones. In this paper, we introduce a new efficient algorithm for drawing hierarchical graphs based on the well-known barycenter algorithm. Our algorithm improves the existing layer-by-layer techniques by 15-25% and recent global algorithms by 5% further reduction in the number of crossings.