Determine whether or not model is "inside out"

This is EXACTLY what I was looking for! I was able to incorporate this into my script and it works beautifully. I don't have any more objects inside-out anymore. THAN$$anonymous$$ YOU!

Either the link in @Cyclops post is broken, or my browser just doesn't like it.

Here's another link to :

How to deter$$anonymous$$e if a polygon is clockwise

...and just in case that link dies at some point also, here's what the highly-upvoted answer on that topic says :

Some of the other suggested methods will fail in the case of a non-convex polygon, such as a crescent. Here's a simple one that will work with non-convex polygons (it'll even work with a self-intersecting polygon like a figure-eight, telling you whether it's mostly clockwise).

Sum over the edges, (x2-x1)(y2+y1). If the result is positive the curve is clockwise, if it's negative the curve is counter-clockwise. (The result is twice the enclosed area, with a +/- convention.)

point[0] = (5,0) edge[0]: (6-5)(4+0) = 4 point[1] = (6,4) edge[1]: (4-6)(5+4) = -18 point[2] = (4,5)
edge[2]: (1-4)(5+5) = -30 point[3] = (1,5) edge[3]: (1-1)(0+5) = 0 point[4] = (1,0) edge[4]: (5-1)(0+0) = 0 --- -44 counter-clockwise

--post by user : "Beta" at stackoverflow.com

...and here's a little function I just made a little bit ago for using what Beta at stackoverflow showed us (Thanks, Beta).

It's working on convex AND concave polygons so far in my tests building some oddball meshes, but it's not doing so well with squirrelly self-intersecting poly's (might work with fig-8's like Beta said, but I didn't try that because I'm only using it for con[cave/vex] poly's anyway and only did some weird intersectors just to see what happened).

C#

 bool PolygonIsClockwise(params Vector2[] points)
 {
    int l = points.Length ;
 
    float sum = 0f ;
 
    for(int i = 0 ; i < l ; i++)
    {
       int n = i+1 >= l-1 ? 0 : i+1 ;
 
       float x = points[n].x - points[i].x ;
       float y = points[n].y + points[i].y ;
       sum += (x*y) ;
    }
 
    return (sum < 0) ? false : true ;
 }

UnityScript

 function PolygonIsClockwise(points : Vector2[]) : boolean
 {
    var l : int = points.length ;
    var sum : float = 0f ;
 
    for(i : int = 0 ; i < l ; i++)
    {
       var n : int = i+1 >= l-1 ? 0 : i+1 ;
 
       var x : float = points[n].x - points[i].x ;
       var y : float = points[n].y + points[i].y ;
       sum += (x*y) ;
    }
 
    return (sum < 0) ? false : true ;
 }

Think I did the UnityScript conversion right anyway, getting rustier at that language after I moved over into C#.