Extract indexed points from list of points

Anyone know a quick and easy way to do this? I have a list of points and points within this list that I have identified as closest to some other points outside of the list. The closest point box returns the indexes of the points. I can't figure out a simple way to extract those indexed points from the original list of points and leave the points that are not returned by the closest point box.

Replies to This Discussion

Permalink Reply by °[u on July 10, 2009 at 9:07am

hi Adam,

do you mean this?

Permalink Reply by Adam Holloway on July 10, 2009 at 9:22am

Thanks for the reply.
That gives the closest points, but the closest point component already does that.
What I need is the all the points in the original list that are not in the closest point list. So basically I need to make a pattern somehow using the indexes to cull the original list. This doesn't seem to be as easy as it sounds.
The title of this thread should probably be 'cull indexed points from list of points'.

Permalink Reply by °[u on July 10, 2009 at 9:40am

better? ;-)

Permalink Reply by Adam Holloway on July 10, 2009 at 10:01am

Better, but it returns a list for each separate 'closest point' of all the points minus one. I need to create a pattern where all the 'closest points' are identified within the list and culled from it as one list, which is why I thought, knowing the indexes of all of them, it should be easy. The next thing I tried was to use the sort component to sort the indexed points out of the list. This didn't seem to work either.

Permalink Reply by °[u on July 10, 2009 at 10:10am

i think you can solve this also with "trees"...
can you post your ghx? i'll take a look on it

Permalink Reply by Adam Holloway on July 10, 2009 at 10:19am

Here's the ghx. See, I want to remove blocks from a grid of blocks wherever they are crossed over by a drawn line or curve.
I will give it a go with trees.

Attachments:

cull points from ptlist.ghx, 144 KB

Permalink Reply by °[u on July 10, 2009 at 10:51am

take a look at this...

good luck

[u

Attachments:

cullpointsfromptlist_u.ghx, 167 KB

Permalink Reply by Adam Holloway on July 10, 2009 at 10:31am

I think maybe what is needed is something like the dispatch component with booleans, but with tree branches instead. So then you can split the list into the chosen points and the others.

Permalink Reply by Adam Holloway on July 10, 2009 at 11:04am

Thanks for your help °[u, it works well, though it will probably be messy for dealing with many curves.

RSS