d0ab8270d9
segments in Boolean against the shell, not the intersection polygon. (We just cast a ray, and use the surface-line intersection function that already existed.) That's slow, but can be accelerated later. [git-p4: depot-paths = "//depot/solvespace/": change = 1911] |
||
---|---|---|
.. | ||
boolean.cpp | ||
ratpoly.cpp | ||
surface.h | ||
surfinter.cpp | ||
triangulate.cpp |