Square This algorithm works by taking the least and max vertex in the mesh, then generating a series of planes to cut the mesh. The resulting intersections are the cuts. The cuts are then bevelled, ...