2023667311
point, and to intersect three surfaces at a point. So now when we split an edge, we can refine the split point to lie exactly on the trim curve, so I can do certain Booleans on curved surfaces. But surface-line intersection is globally broken, since I don't correctly detect the number of intersections or provide a good first guess. I maybe should test by bounding boxes and subdivision. [git-p4: depot-paths = "//depot/solvespace/": change = 1920] |
||
---|---|---|
.. | ||
boolean.cpp | ||
ratpoly.cpp | ||
surface.h | ||
surfinter.cpp | ||
triangulate.cpp |