Choosing Specific Items from List with different Lengths.. HELP QUICK PLS.

Hello,

I have a triangulated Geometry from wich i wanted to find the biggest and smallest angle of all faces, which is needed to prozess further in the detail of designing a pavillon.

Therefore i picked the interior edges of the joined geometry and constructed perpendicular frames, which i then used to construct circles and intersect them with each face. After that i exploded the curves and measured the angles between them. so far so good. Now i can´t think of a way to choose from the list of the faces the two faces which have the biggest/smallest angle..

(Can´t Pick them manually, because the geometry is optimized by another Person, and i need to stay flexible.. sooo list item with flatten and then "good-luck-looking" for the right items, as the relative list value of the max/min angles might change, is not really an option)

Does Anyone know a solution or allready had similar Problems?

Any Help ASAP would be really apreciated. We are about to start building soon and i have still a ton of other problems to solve. :)

Best Regards,
Deen

Attachments:

20150615_max_angle_problem.3dm, 278 KB
20150615_max_angle_problem.gh, 12 KB

Replies to This Discussion

Permalink Reply by peter fotiadis on June 16, 2015 at 12:37am

This case has an Alexander aroma , he he (Don't ask who's Alexander) ... so get exactly what I did for Alexander long time ago.

After understanding what's happening around delete all the demo bits.

best

Attachments:

Tri_mesh_inquire_V1.gh, 45 KB

Permalink Reply by Deen on June 18, 2015 at 1:46am

Thank you Peter,

that definition really cool definition!!!
Unfortunately we are not working with Mero, but was still helpful :)

Permalink Reply by Julian Buhagiar on June 16, 2015 at 5:00am

bounds component might help determine the min max and then deconstruct bounds.

as for selecting the face this might be trickier from the way youve organised the flow. it would be neater to associate the angles in a grafted tree (A;x) rather than a number of separate circles. Where A is a face and x are the angles within the face

e.g each face may have 3 vertices and 3 angle so where face A contains a minimum or maximum angle x. the branch A can be selected when any leaf x = min or max is true.
the list, sets and tree components will help with this.

i would be willing to help you with examples if you wish to send what youve done so far.

Permalink Reply by Julian Buhagiar on June 16, 2015 at 4:19pm

hope the attached helps...

The vertex shows which is min or max with a colour indicating as some faces may possess both min and max angles. Upon realising some edges may be unintendedly modelled as 180 degrees to eachother but are not actually meant to be two separate edges, you can modify the slider to change the tolerance you're after

Attachments: