Thanks for the reply!

If I may, I'd like to rephrase to see if I understood properly:

There is an algorithm that determines the size of and densely populates a tesselation of the disk by hexagons from an ordered tree. But there is ambiguity when using a (general) tree as one must make a choice on ordering, and the results may or may not be visually pleasing output. Since the algo is slow and users must perform permutations manually (say in the json storing the ordered tree) , it is very time consuming to get to a nice looking output.

In short, we're looking at either speeding up the algorithm so as to present many choices simultaneously and allow quick access to a good looking viz or at finding a objective function to optimize that'll produce a good looking viz every time.

I may possibly be out of my depth there, but I am definitely motivated to get this available so that people can visualyse their teams' strengths and weaknesses from a skill evaluation based on a skill taxonomy.

You can find me on GitHub @LeData.