solvespace/srf
Jonathan Westhues bc70089dd0 Add code to subdivide (with de Castljau's algorithm) a surface, and
use that for surface-line intersections. That has major problems
with the heuristic on when to stop and do Newton polishing.

There's also an issue with all the Newton stuff when surfaces join
tangent.

And update the wishlist to reflect current needs.

[git-p4: depot-paths = "//depot/solvespace/": change = 1925]
2009-03-08 02:59:57 -08:00
..
boolean.cpp Add code to subdivide (with de Castljau's algorithm) a surface, and 2009-03-08 02:59:57 -08:00
ratpoly.cpp Add code to subdivide (with de Castljau's algorithm) a surface, and 2009-03-08 02:59:57 -08:00
surface.h Add code to subdivide (with de Castljau's algorithm) a surface, and 2009-03-08 02:59:57 -08:00
surfinter.cpp Add code to subdivide (with de Castljau's algorithm) a surface, and 2009-03-08 02:59:57 -08:00
triangulate.cpp Add code to subdivide (with de Castljau's algorithm) a surface, and 2009-03-08 02:59:57 -08:00