Filter curves based on # of intersection points

I'm trying to do the following:

1. Count # of intersection points found on each circle

2. Filtered circles based on # of intersections

I'm not familiar with the process in GH, and any help would be much appreciated.

Attachments:

intersection-filters.JPG, 42 KB
intersection-filters-def.gh, 6 KB

Replies to This Discussion

Permalink Reply by nikos tzar on September 16, 2015 at 5:37pm

Hello Zak,

If you trim the tree of points you will have a tree with 19 branches (as many as the circles) and each branch will contain the intersection points of each circle. You can then use [list Length] to get the number of points for each circle and then -depending on what you mean by "filter"- you can use something like [cull pattern] to only keep the circles that have a specific number of points:

Cheers,

Nikos

edit!

You have some duplicate lines (on top of each other) which results in more intersection points than you actually see. Try to remove them before using the definition

Attachments:

intersectionfiltersdef-nt.gh, 11 KB

Permalink Reply by Zack on September 17, 2015 at 8:41am

Awesome!

Thanks for the help, that's exactly what I was looking for.

I had been using a Kangaroo component for the consolidation of duplicate lines, and in my attempt to make the uploaded definition more 'universal' I fear I must have internalized the curve data a bit too far up stream.

Thanks again,

Zack

RSS