Jonathan Westhues 6d7954e167 Fix an issue with edge intersection testing: if a vertex from edge ... A touches edge B, but does not share a vertex with edge B, then that's an intersection. Adjust the ear clipping so that it generates strip-like triangulations, not fan-like. And rearrange deck chairs on the bridge-finding code, which is still pathetically slow. It may not be possible to get reasonable performance without kd tree type acceleration. [git-p4: depot-paths = "//depot/solvespace/": change = 1901]		2009-01-22 02:02:46 -08:00
..
ratpoly.cpp	Fix an issue with edge intersection testing: if a vertex from edge	2009-01-22 02:02:46 -08:00
surface.h	Early attempts at rational polynomial surfaces. I can create one	2009-01-19 02:37:10 -08:00
triangulate.cpp	Fix an issue with edge intersection testing: if a vertex from edge	2009-01-22 02:02:46 -08:00