Showing content from http://paulbourke.net/geometry/polygonmesh/source2.c below:
/* Return whether a polygon in 2D is concave or convex return 0 for incomputables eg: colinear points CONVEX == 1 CONCAVE == -1 It is assumed that the polygon is simple (does not intersect itself or have holes) */ int Convex(XY *p,int n) { int i,j,k; int flag = 0; double z; if (n < 3) return(0); for (i=0;i 0) flag |= 2; if (flag == 3) return(CONCAVE); } if (flag != 0) return(CONVEX); else return(0); }
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4