Concave hull generator
Unite all dots under the smallest possible area. It comes with a simple demo for unity using just gizmos.
How it works
Inspired by Implementation of a fast and efficient concave hull algorith, the concave hull is reached through the finding of middlepoints within the edges of the convex hull. If the cosine between the middlepoint and the edge nodes is greater than the concavityvariable the segment will be partitioned in two new ones using the new point. The search for middlepoints starts from the longest edge to the shortest. If no middlepoints are found the program will end.
Middlepoints are searched in an area around the edge that can be set using the scaleFactor variable. The higher the area the slower the program will be.
Another variable to take in consideration is the isSquareGrid boolean. When using square grids for the dot distribution it could occur that the addition of a middlepoint creates a segment tangent to the hull. If true a check is made to avoid this situation. Warning: It could be a time consuming check.
