zcy
/
solvespace
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
solvespace/wishlist.txt

15 lines
227 B
Plaintext
Raw Normal View History

Improve convergence of constraints involving parallel vectors, by using the initial numerical guess of whichever vector is already known to choose our projection planes. And add a mechanism to defer showing the text window or regenerating, in order to simplify dependencies on valid actives. Also yes/no/cancel when about to abandon an unsaved file, and a bugfix when rotating a rot/trans point. [git-p4: depot-paths = "//depot/solvespace/": change = 1772]
2008-06-03 18:28:41 +00:00
A better fix to the display mesh issue; instead of drawing the previous group, copy the previous group's mesh into ours, and draw ours. This makes other stuff that uses that mesh (like the export and analysis code) work properly. [git-p4: depot-paths = "//depot/solvespace/": change = 2050]
2009-10-08 07:55:09 +00:00
copy and paste
Add O(n*log(n)) self-intersection check for polygons. That was previously a major bottleneck, and is now at least 10x faster for a practical section. And fix a horrible uninit memory bug in the triangle kd-tree stuff; the split planes were apparently random. This would have slowed things down, but not caused an incorrect result; except when it ends up NaN, which is the reason I noticed. [git-p4: depot-paths = "//depot/solvespace/": change = 2073]
2009-11-09 11:51:38 +00:00
spline splitting
Add a special constraint type for comments; no equations, just user-visible text. And make points hoverable/selectable even when GW.showPoints is false, and zoom to fit before regenerating on file open, because then we're at the right zoom level (and will use the right pwl tolerance). [git-p4: depot-paths = "//depot/solvespace/": change = 1788]
2008-06-12 08:58:58 +00:00
-----
Add O(n*log(n)) self-intersection check for polygons. That was previously a major bottleneck, and is now at least 10x faster for a practical section. And fix a horrible uninit memory bug in the triangle kd-tree stuff; the split planes were apparently random. This would have slowed things down, but not caused an incorrect result; except when it ends up NaN, which is the reason I noticed. [git-p4: depot-paths = "//depot/solvespace/": change = 2073]
2009-11-09 11:51:38 +00:00
associative entities from solid model, as a special group
Increment the version number, and add a context menu item to snap what's hovered to the grid. [git-p4: depot-paths = "//depot/solvespace/": change = 2042]
2009-09-30 08:54:01 +00:00
some kind of import
Add a context menu, with a grab bag of options. That will need some refinement later, but it does not affect file formats so it's not very critical. [git-p4: depot-paths = "//depot/solvespace/": change = 2032]
2009-09-23 10:59:59 +00:00
faster triangulation
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 10:59:57 +00:00
loop detection
Show a progress message when regenerating is slow. And update the version number to 1.4, don't include force-hidden entities when building the loops, and don't show force-hidden entities when that entity gets copied. [git-p4: depot-paths = "//depot/solvespace/": change = 1983]
2009-06-14 04:36:38 +00:00
IGES export
incremental regen of entities
Change how step and repeat works: now I build the union of all the steps in thisShell or thisMesh, and then let the Boolean proceed as usual. If everything works, then this is equivalent. And it's less code, and it makes stuff like stepping the step and repeat work. Also begin to work on line/entity/constraint styles, but no real work yet. [git-p4: depot-paths = "//depot/solvespace/": change = 2018]
2009-07-20 01:47:59 +00:00
rounding, as a special group
Add routines to remove T intersections from the mesh, which are introduced by the bsp routines. It's usually, though not always, possible to generate a watertight mesh. The occasions where it's not look ugly, floating point issues, no quick fix. And use those to generate a list of edges where two different faces meet, which I can emphasize for cosmetic reasons (and some UI to specify whether to do that, and with what color). And make the right mouse button rotate the model, since that was previously doing nothing. [git-p4: depot-paths = "//depot/solvespace/": change = 1821]
2008-07-06 07:56:24 +00:00
Improve convergence of constraints involving parallel vectors, by using the initial numerical guess of whichever vector is already known to choose our projection planes. And add a mechanism to defer showing the text window or regenerating, in order to simplify dependencies on valid actives. Also yes/no/cancel when about to abandon an unsaved file, and a bugfix when rotating a rot/trans point. [git-p4: depot-paths = "//depot/solvespace/": change = 1772]
2008-06-03 18:28:41 +00:00