Poly mesh neighbour
A very fast algorithem for finding shared edges in a polygon soup. This is a algorithem i have invented that is close to linear in preformance.
f_sort_quad_tri_neighbor
uint *f_sort_quad_tri_neighbor(uint *ref, uint quad_length, uint tri_length, uint vertex_count);
f_sort_tri_neighbor
uint *f_sort_tri_neighbor(uint *ref, uint tri_length, uint vertex_count);