branching 2d

Comment

Comment by emlplsn on January 18, 2016 at 7:16pm

Thanks Christian! Good info. I appreciate your fast response.

//Emil

Comment by Christian Schmidts on January 18, 2016 at 4:37pm

Hi Emil,

1. like you said

2. find the shortest walk between all and one vertex through the mesh (and remove duplicates)

3. the i use the tool by Laurent described in the link above

4. finally the trucate mesh component in starling

if you search the forum for shortest walk branching you will find several results 

~C

Comment by emlplsn on January 18, 2016 at 3:06am

Cool! Could you elaborate a little more on the generation of the networks? My guess would be something like this:

1. Generating a mesh with varying density using mesh machine (finer towards the edge).

2. Picking out the outermost (naked?) vertices and a centre point

3. Finding the shortest walk between the outermost vertices and the central point.

Cheers

//Emil