Step 0

n = number of vertices

for(i = 0; i<n; i++) {

d = degree of vertex i

if(d<5) r[i] = .5; else r[i] = d/10

r2 = r[i] * r[i]

x2 = 1/(8*(1-cos(2π/d)))

R[i] = sqrt(x2*r2/(r2 – x2))

totalR += R[i] //store for AvgR

}

AvgR = totalR / n

Step i

for(i=0; i < # of vertices; i++) {

r[i] += .1*(R[i] – AvgR)

d = degree of vertex

r2 = r[i] * r[i]

x2 = 1/(8*(1-cos(2π/d)))

R[i] = sqrt(x2*r2/(r2 – x2))

totalR += R[i] //store for AvgR

}

AvgR = totalR / n

For getting coordinates

Step 0

send every pt to (0, 0, d_i), where

d_i = sqrt(R² + r_i²)

Step 1

keep pt 0 @

send all others to (x_i, 0, z_i) where

z_i = (R² – r₀ * r₁)/d₀

x_i = sqrt( d_i² – z_i²), and d is from Step 0

Step 2

keep pt 0 @ (0, 0, d₀), pt 1 @ (x₁, 0, z₁)

for others:

Given pt(i-1) @ (x_i-1, y_i-1 , z_i-1), w/ q_i-1

put pt(i) @ (x_icosq_i, x_isinq_i, z_i) where

x_i, z_i are from Step 1, and

q_i = arccos(((z_i - z_i-1)²+x_i²+x_i-1²–r_i–r_i-1)/

(2x_i* x_i-1))