What would be the most sensible and simple way to find the furthest to the right and furthest to the left in a collection of vertices?
I have a bunch of Type instances, each containing the fields vert0, vert1, and vert2. I probably need to iterate through them in a For loop, and find the single vertice (of all vert0,vert1, and vert2) that is largest for x position and another that is smallest for x position. I think I have a way to do this, but it's confusing me which isn't a good sign, so you guys might have a magic way so I may as well ask. Please help.
I have a bunch of Type instances, each containing the fields vert0, vert1, and vert2. I probably need to iterate through them in a For loop, and find the single vertice (of all vert0,vert1, and vert2) that is largest for x position and another that is smallest for x position. I think I have a way to do this, but it's confusing me which isn't a good sign, so you guys might have a magic way so I may as well ask. Please help.