3 Commits (d0ab8270d9d2eb74cbda8f7bdf1b51783964dd69)

Author	SHA1	Message	Date
Jonathan Westhues	d0ab8270d9	Fix stupidity in Point2d::DistanceToLine, and classify line ... segments in Boolean against the shell, not the intersection polygon. (We just cast a ray, and use the surface-line intersection function that already existed.) That's slow, but can be accelerated later. [git-p4: depot-paths = "//depot/solvespace/": change = 1911]	2009-02-01 05:01:28 -08:00
Jonathan Westhues	9ffe95ea65	More work on Booleans. This works only for planes, and only for ... non-coincident faces. There's also a problem when I don't generate the full intersection polygon of shell B against a given surface in shell A; I need to modify the code to not require that. [git-p4: depot-paths = "//depot/solvespace/": change = 1910]	2009-01-31 21:13:43 -08:00
Jonathan Westhues	a754018a44	More poking at Booleans; generate the unsplit intersection curves ... for planes against planes. [git-p4: depot-paths = "//depot/solvespace/": change = 1907]	2009-01-26 23:59:58 -08:00