Drawing Hypergraphs in Hyperedge’s Average Degree and Multi-Rules

Abstract

By analysing the past algorithms of drawing hypergraphs, this paper gives the definition of hyper graphs’ vertex degree and hyperedge’s average degree at first. Then it introduces the flow of this algorithm and particularly describes the rule set in setting the position of the vertex and the principal of minimum envelop law in drawing the hyperedge, and the complexity of this algorithm is analyzed. At last it draws a hypergraphs of scientific collaboration network successfully based on this algorithm and the result proves that the drawing algorithm of hyper graphs based on hyper edge’s average degree and multi-rules is feasible.