The problem of solving angular constraints has interested me for a while. I want to be able to programmatically lay out an optical setup with SVG. Here is my work so far, but I've run up against the problem of dealing with cyclic graphs. The "rewrite" branch uses a different approach based on an academic paper.<p><a href="https://github.com/SeanDS/optivis/tree/rewrite" rel="nofollow">https://github.com/SeanDS/optivis/tree/rewrite</a>
I'm not quite able to run the code (too much load on the server probably). But is this something that can solve LPs in the browser (possibly more than just LPs, I think)? This would be incredibly helpful for many people I'm sure--all the existing online ones have arcane input reqs (and unhelpful errors) and standalone applications either cost money (Gurobi, cplex) or are not easy to use at all (gnu glpk).
<p><pre><code> -- Result received at 14:30:3, response time of 24.714s --
Execution Timed Out
</code></pre>
Seems very interesting, will check it out and hopefully provide some feedback when it's back online