solvespace/srf
Jonathan Westhues 666ea1c047 Add beginnings of marching surface intersection; I can find all the
boundary points, at least. That required some changes to what gets
passed around (for example because to project a point onto this
inexact curve, we need to know which two surfaces it trims so that
we can do a Newton's method on them).

And fix stupidity in the way that I calculated edge normals; I just
did normal in uv space, and there's no particular reason why that
would be normal in xyz. So edges in long skinny surfaces failed,
for example.

[git-p4: depot-paths = "//depot/solvespace/": change = 1990]
2009-06-18 23:56:33 -08:00
..
boolean.cpp Add beginnings of marching surface intersection; I can find all the 2009-06-18 23:56:33 -08:00
curve.cpp Add beginnings of marching surface intersection; I can find all the 2009-06-18 23:56:33 -08:00
merge.cpp Oops, don't let the coincident surface merging stuff try to merge 2009-06-10 00:26:09 -08:00
ratpoly.cpp Add beginnings of marching surface intersection; I can find all the 2009-06-18 23:56:33 -08:00
surface.cpp Add beginnings of STEP export, which weren't as horrible as I had 2009-06-07 22:50:16 -08:00
surface.h Add beginnings of marching surface intersection; I can find all the 2009-06-18 23:56:33 -08:00
surfinter.cpp Add beginnings of marching surface intersection; I can find all the 2009-06-18 23:56:33 -08:00
triangulate.cpp When exporting STEP, identify the outer contours, and group them 2009-06-08 08:21:33 -08:00