I’m wondering if anyone has ever created a efficient algorithm for finding the largest face from a group of entities:
Here is my basic grep for faces:
group1faces = entities1.grep(Sketchup::Face)
I suppose whether I loop through all the faces comparing areas or I let some internal function of some sort do it it probably doesn’t make a whole lot of difference, but I thought I should ask before creating my own algorithm. Nine times out of ten someone else has already encountered a similar problem and has a solution that is usually better than what I will come up with on my first go around.