Sublist!

Replies to This Discussion

Permalink Reply by Thibault Schwartz on January 20, 2011 at 2:31pm

See the attached file, but one solution is to test the distance between the center of your figure and the surrounding points, then sort them by < or > or = with a little tolerance for avoiding errors.

A second one could be to generate 2 offsets for each "region" and then test your points for inclusion in these regions (in the case you have more than 3 groups of points, it will be more appropriate).

Attachments:

• voronoi_critchlow_test_02-1.ghx, 345 KB

Permalink Reply by RWNB on January 20, 2011 at 4:54pm

dear thibal,

 

thanks a lot for your work.

very cool.

Permalink Reply by RWNB on January 21, 2011 at 7:01am

dear Thibal,

 

sorry for the request!

can you explain, what you mean with "generate 2 offset for each region"?

 

thanks

Permalink Reply by Thibault Schwartz on January 21, 2011 at 8:04am

Finally it is not a good solution. Here is a file that let you search for regions of points (sorted by distances from the center) and then make a tree for each region (so you have all the points of same distance from the center that are together by branches). Then it is using kangaroo removeDuplicatePoints to avoid any weird overlapping points.

Attachments:

• voronoi_critchlow_test_02-2.ghx, 500 KB

Permalink Reply by RWNB on January 21, 2011 at 9:01am

dear Thaibal,

you are a great help.

thanks a lot.