solvespace/srf
Jonathan Westhues f7f9000c68 Discard intersection curves that lie entirely outside of one
surface's domain of u, v in [0, 1]. Cache the starting guess when
projecting a point into a ratpoly surface, to avoid brute force
searching for a good one every time. Split edges even if they
aren't quite inside the trim curve, since the trim boundaries are
pwl, not exact; unnecessary splits won't hurt, but failure to split
when necessary will. Make the triangulation code use a better (but
not perfect) epsilon, to avoid "can't find ear" failures on very
fine meshes.

And turn on compiler optimization! I had somehow forgotten about
that, and it's a ~2x improvement.

[git-p4: depot-paths = "//depot/solvespace/": change = 2026]
2009-08-20 20:58:28 -08:00
..
boolean.cpp Discard intersection curves that lie entirely outside of one 2009-08-20 20:58:28 -08:00
curve.cpp Replace the closed-form solutions for entity-entity splitting with 2009-07-07 00:21:59 -08:00
merge.cpp Discard intersection curves that lie entirely outside of one 2009-08-20 20:58:28 -08:00
ratpoly.cpp Discard intersection curves that lie entirely outside of one 2009-08-20 20:58:28 -08:00
raycast.cpp I had been using LENGTH_EPS as the tolerance on both xyz points and 2009-07-01 19:32:17 -08:00
surface.cpp Discard intersection curves that lie entirely outside of one 2009-08-20 20:58:28 -08:00
surface.h Discard intersection curves that lie entirely outside of one 2009-08-20 20:58:28 -08:00
surfinter.cpp Discard intersection curves that lie entirely outside of one 2009-08-20 20:58:28 -08:00
triangulate.cpp Discard intersection curves that lie entirely outside of one 2009-08-20 20:58:28 -08:00