Unit Disk Graphs: How Can I Represent the Connection Range?
Posted: 25 Feb 2015 22:10
In a unit disk graph, N nodes are distributed at random inside a square, with pairs of nodes connected if their mutual Euclidean separation is less than 1.
Representing these geometric graphs in Gephi, how can I add little circles of radius 1 around each node to indicate the transmission range (such as in the picture below, courtesy my colleague Dr Orestis Georgiou of Toshiba Labs)?
Representing these geometric graphs in Gephi, how can I add little circles of radius 1 around each node to indicate the transmission range (such as in the picture below, courtesy my colleague Dr Orestis Georgiou of Toshiba Labs)?