
* Rewrite surface handles in curves, so that Booleans beyond the first don't screw up. * If an intersection curve is identical to an existing curve (as happens when faces are coincident), take the piecewise linearization of the existing curve; this stops us from screwing up when different shells are pwl'd at different chord tols. * Hook up the plane faces again. * Remove coincident (parallel or anti-parallel) edges from the coincident-face edge lists when doing Booleans; those may happen if two faces are coincident with ours. * Miscellaneous bugfixes. It doesn't seem to screw up very much now, although tangent edges (and insufficient pwl resolution) may still cause problems. [git-p4: depot-paths = "//depot/solvespace/": change = 1929]
19 lines
372 B
Plaintext
19 lines
372 B
Plaintext
|
|
marching algorithm for surface intersection
|
|
surfaces of revolution (lathed)
|
|
cylinder-line special cases
|
|
exact boundaries when near pwl trim
|
|
tangent intersections
|
|
short pwl edge avoidance
|
|
exact curve export (at least for dxf)
|
|
hidden line removal from mesh
|
|
line styles (color, thickness)
|
|
assembly
|
|
|
|
-----
|
|
loop detection
|
|
incremental regen of entities?
|
|
IGES and STEP export
|
|
|
|
|