Selection of a point, a line, and distance

hello everybody, and Please teach me.

Solving this big problem has a big meaning for me.

The contents are image:

Replies to This Discussion

Permalink Reply by Massimiliano Trave on December 14, 2011 at 12:42pm

sorry for my bad english.

yes the second that you say,and why you organize the input data of hoopsnake with a list of three branches 1 branch
2 branches
3-line with zero length

Permalink Reply by Yoann Mescam (Systemiq) on December 14, 2011 at 3:40pm

First branch B1 stores the number of connections allowed for each point , 2nd one B2 stores the points, 3rd one B3 stores the created connections.

B1[i]=number of remaining allowed connections for point B2[i] so B1[i]<=0 means no new connections allowed for point i ,so point i is deleted from B1, B2 updated accordingly.

Initialization:

B1: max number of connections x number of points

B2: all the points

B3: nothing (well null or something, need to create the branch)

Algo:

Get first point in B2, get his allowed number of connections N in B1, find N closest points in B2, create lines in B3, update B2 accordingly. Erase points with max connections (including the first point)

Stop when no points available

At end of loop, B3 stores the created lines.

Permalink Reply by Massimiliano Trave on December 15, 2011 at 12:56am

Thanks a lot Sistemiq now i understand :)