I am working on this script trying to find subdivision inside of NGons. This screenshot is an example of what I want to achieve. Basically, The subdivision happened as a result of a polyline that connects a mod point of Ngon edges, and since the cells has different sizes the iteration should stop where the smallest subdivision reach an approximate number where all cells share. At the moment I did it with a repetitive way which i believe it is not a right way. It seems to me that it need Anemone or Code to achieve this goal. I posted the GH Definition below, If anyone comes across and have some idea please share. Thank you
Why not a simple cascade (that’s why we have computers). Ultracentrifuges or Ultra high voltage generators work the same way. Simply keep adding to what you have. Copy > Paste = fast.
For nicer looks you could build a cluster. And add these in line (or nest them). But in my opinion that’s more work, probably not faster and harder to see what is being done.
PS: To “stop” the process, I used Area + Sort + Split list.
You could also compare the result Area with the Area of the first shape (so every shape has its own regulator.
Or use this to “cut off” the last stages in the cascade (then all shape will have the same number of “inner shapes” .
PS2: + a pschological effect: The “middle areas” are all about the same size. But they look very different, because the “outer areas” differ a lot. Funny.
Thank you for getting back and your suggestion, I actually tried anemone as well. But the only thing is that all geometry will stop at the same iteration which it doesn’t consider the size of the geometries. The result I am aiming is to have more subdivision on the larger ngon basically.
Just do a lot of iterations (with anemone) or in the cascade I suggested.
At the end measure size, area, whatever, + compare to what you want and use dispatch or split list, cull etc to drop what you do not want.
Dear @Ali_Najmaei . The purpose of my answers is to show there are several roads to solve this issue. Depending a bit on how parametric, fast etcetera you want it. “Many roads lead to Rome”
In the end, I think this could be solved by a mathematical approach. If you look at the drawings, you see that the eindpoints of the even and so from the uneven endpoints are lined up very well with distances getting closer to the middle. My mathematics are not suffiient for that, but should be possible
Anemone doesn’t have a while loop, but I suppose you could achieve this by nesting the loop of the script inside another so you don’t have to manually adjust the iterations slider. Don’t mind the orange Polyline component. It is just showing a warning as polylines that under-ceed the area cap are culled from the data structure, feeding Polyline a null to compute.
"I suppose you could achieve this by nesting the loop of the script inside another" Nope. Maybe get one of the coding experts, or novices really, to do this.
