| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Merge further bbox work | MenTaLguY | 2007-03-10 | 1 | -42/+33 |
| | | | | (bzr r2596) | ||||
| * | - Connectors with end-markers now constrained to point downwards in graph layout | Tim Dwyer | 2006-07-14 | 1 | -0/+2 |
| | | | | | | - vpsc namespace added to libvpsc (bzr r1408) | ||||
| * | Previously graph layout was done using the Kamada-Kawai layout algorithm | Tim Dwyer | 2006-07-12 | 1 | -3/+3 |
| | | | | | | | | | | | | | | | | | | implemented in Boost. I am replacing this with a custom implementation of a constrained stress-majorization algorithm. The stress-majorization algorithm is more robust and has better convergence characteristics than Kamada-Kawai, and also simple constraints can be placed on node position (for example, to enforce downward-pointing edges, non-overlap constraints, or cluster constraints). Another big advantage is that we no longer need Boost. I've tested the basic functionality, but I have yet to properly handle disconnected graphs or to properly scale the resulting layout. This commit also includes significant refactoring... the quadratic program solver - libvpsc (Variable Placement with Separation Constraints) has been moved to src/libvpsc and the actual graph layout algorithm is in libcola. (bzr r1394) | ||||
| * | Apparently a problem was reported with one of the test cases. | Tim Dwyer | 2006-05-10 | 1 | -3/+3 |
| | | | | | | | | | I can't reproduce the problem, however solve_VPSC code in inkscape was getting quite out of date with that in www.sf.net/projects/adaptagrams. I've updated the code, which may fix the problem, or at least if it's reported again then I'll know it's still an issue. (bzr r803) | ||||
| * | moving trunk for module inkscape | MenTaLguY | 2006-01-16 | 1 | -0/+80 |
| (bzr r1) | |||||
