whitequark changed the topic of #solvespace to: SolveSpace--parametric 2d/3d CAD · latest version 2.3 · http://solvespace.com · code at https://github.com/solvespace/solvespace · logs at https://irclog.whitequark.org/solvespace
_whitelogger has joined #solvespace
tristero has quit [Ping timeout: 260 seconds]
tristero has joined #solvespace
cr1901_modern has quit [Read error: Connection reset by peer]
Guest53415 has quit [*.net *.split]
lineprinter has joined #solvespace
lineprinter is now known as Guest87413
Thaolia has quit [Quit: ZNC 1.6.2 - http://znc.in]
Thaolia has joined #solvespace
<tristero> If two groups of constraints are provably equivalent in Euclidean geometry, will it ever be the case that one will be solved and the other won't?
<whitequark> yes
<whitequark> solvespace uses numeric methods
<whitequark> sometimes it can produce identical equations, sometimes not, if you have significant structural differences probably not
<tristero> I'm trying to step-translate N objects, and also constrain the inter-object distance to be equal to the distance to another feature. Nothing I do seems be solvable; is there a way I'm missing?
<tristero> nvm, I seem to have found a way (I guess this was one of those examples of equivalent constraints, only one of which was solvable)
traverseda has quit [Read error: Connection reset by peer]