Prompt user to enter τ, the desired number of new locations to be added per observed discrete location nk in K For each observed discrete state nk in K

Determine the nearest neighbor nj

For σ = τ to σ = 1

Draw σ new nodes, p, from nk at a distance αp from nk where αp = || nk ± nj || / 2

Space each node p at θp = [2π / σ+1)] radians from each other p relative to a vector from nk to nj

For m = σ − 1 to m = 1

Draw m new nodes, q, from each node p at a distance αm where αm = αp / 2

Space each node q at θq = (2π / m+1) radians from each other q relative to a vector from p to nk

m = m− 1

σ = σ – 1

Move to the next observed discrete state