c6b429b9ce
way to think about the cases; I'm classifying the regions to the left and right of each edge, and keeping the edges if those regions (2d, surfaces) classify different. Still screws up with edge-on-edge intersections; but if I make the surface intersection stuff handle that, then might be more straightforward to use that info. [git-p4: depot-paths = "//depot/solvespace/": change = 1914] |
||
---|---|---|
.. | ||
boolean.cpp | ||
ratpoly.cpp | ||
surface.h | ||
surfinter.cpp | ||
triangulate.cpp |