Jonathan Westhues 7cf3a06274 A very rough set of routines to triangulate by ear clipping. This ... is O(n^2), not perfectly robust, and the bridge-finding code is particularly bad. But it works, triangulates, and shouldn't ever generate zero-area triangles like gl does. [git-p4: depot-paths = "//depot/solvespace/": change = 1900]		2009-01-20 21:04:38 -08:00
..
ratpoly.cpp	A very rough set of routines to triangulate by ear clipping. This	2009-01-20 21:04:38 -08:00
surface.h	Early attempts at rational polynomial surfaces. I can create one	2009-01-19 02:37:10 -08:00
triangulate.cpp	A very rough set of routines to triangulate by ear clipping. This	2009-01-20 21:04:38 -08:00