algorithmic modeling for Rhino
Hello guys,
any help would be appreciated.
I have this gradient mesh, depicting point density, red being the highest density and white the lowest. What I want to do is find the points with the highest density amongst their near ones. This would probably result in one point for each of the four or five areas (not necessarily red, since all areas do not have that much density). Any ideas anyone?
Thank you all!
regards
Panos
Tags:
Hi Panos
Took the liberty to "minimize" (he, he) the thing of yours (PS: use option2 [nurbs]: the fastest).
Now we are ready for anything imaginable:
To clarify your requirement: you mean that you need a new DataTree for each point where the sorted [ and culled - based on some min/max dist criteria] distances from his neighbors are listed? Or something else? (absolutely anything is easily doable mind).
best, Peter
In the trad V2 update I've added a proximity thingy as well (centroids VS your original pts sampled in the pList).
Handle with EXTREME care the proximity related sliders.
Added a small C# on top of the main that can guide you in choosing proper search values.
Added a remove duplicate pts option (lot's in your dataset).
Added ... er ... hmm ... a free bonus as well
Peter, thank you very very much. I will check it out thoroughly and come back with questions most likely. Thanks again for the effort, the time and of course the bonus.
regards,
Panos
Added another C# thingy (viz the proximity).
Corrected some ... oops moments (and added some more = progress, he he)
best
Can't thank you enough Peter! Your input is essential,
regards,
Panos
BTW: I've followed (mostly) your line of thought for counting the beans but THIS IS NOT the way to do it (too slow and inefficient). Notify if you want the high performance V3.
Welcome to
Grasshopper
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
© 2024 Created by Scott Davidson. Powered by