Jonathan Westhues 4ca7548ffe Don't merge two coincident surfaces unless they share an edge. ... Otherwise, we might merge in ways that make things slower (because the bboxes aren't as tight) or less robust (because the intersection needs to be split in more places, and that might fail). [git-p4: depot-paths = "//depot/solvespace/": change = 2003]		2009-06-29 20:38:40 -08:00
..
boolean.cpp	Group edges into chains (that don't intersect edges from the other	2009-06-26 21:53:56 -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	Don't merge two coincident surfaces unless they share an edge.	2009-06-29 20:38:40 -08:00
ratpoly.cpp	Now we are actually marching. There seems to be either a numerical	2009-06-21 01:02:36 -08:00
raycast.cpp	Let's use the direction cosines (dot product of unit vectors), not	2009-06-21 22:22:30 -08:00
surface.cpp	Clean up the marching step size / chord tol stuff, and add code to	2009-06-21 18:54:09 -08:00
surface.h	Group edges into chains (that don't intersect edges from the other	2009-06-26 21:53:56 -08:00
surfinter.cpp	Clean up the marching step size / chord tol stuff, and add code to	2009-06-21 18:54:09 -08:00
triangulate.cpp	When exporting STEP, identify the outer contours, and group them	2009-06-08 08:21:33 -08:00