A faster assembly solver

[lenianiva]

Would it be possible to have a faster solver for the assembly?

In many of my use cases, the constraints I write can be viewed as a tree: If there is a constraint between objects A-B and a constraint between B-C, there is usually not one between A-C or A-...-C. For this reason, I think it could be much faster for the solver to run, if it can find the zero point of every constraint, and then start from there. For example, if there is a point constraint between A-B, it will just set the position of B to the position of A.

Would something like this work? If people think its a good idea I can write a PR for it.

[adam-urbanczyk]

Yes some kind of smart starting point selection could be indeed faster. Do you have a MRE that has too high runtime?

[lenianiva]

Yes some kind of smart starting point selection could be indeed faster. Do you have a MRE that has too high runtime?

I don't have a small example since this only becomes a problem with dozens of components.

[adam-urbanczyk]

Could you share at least some details? E.g. output from the optimizer (with assy.solve(verbosity=5).