666ea1c047
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]
15 lines
318 B
Plaintext
15 lines
318 B
Plaintext
|
|
marching algorithm for surface intersection
|
|
grid
|
|
classification of edges only as necessary (all same for span between intersections)
|
|
associative entities from solid model, as a special group
|
|
rounding, as a special group
|
|
|
|
-----
|
|
line styles (color, thickness)
|
|
loop detection
|
|
IGES export
|
|
incremental regen of entities
|
|
|
|
|