inkscape - An experimental livecoding plugin for Inkscape

	Commit message (Collapse)	Author	Age	Files	Lines
*	Put adaptagrams into its own folder	Marc Jeanmougin	2018-04-29	1	-879/+0
\|
*	Updated libs from the Adaptagrams project: libavoid, libcola and libvspc; ↵	Sylvain Chiron	2017-07-01	1	-195/+836
\| \| \| \| \| \|	changed the code to match the new API Signed-off-by: Sylvain Chiron <chironsylvain@orange.fr>
*	"fix" some "unused parameter" warnings	Kris De Gussem	2013-10-27	1	-1/+1
\| \| \|	(bzr r12736)
*	Remove "using namespace" from libcola headers.	Jon A. Cruz	2011-06-27	1	-17/+17
\| \| \|	(bzr r10374)
*	Whitespace cleanup.	Jon A. Cruz	2011-06-26	1	-58/+71
\| \| \|	(bzr r10366)
*	Add virtual to a lot of the destructors. Note: perhaps it will have to be ↵	Johan B. C. Engelen	2007-11-04	1	-2/+2
\| \| \| \| \|	reverted for some files to keep them C-compatible. (bzr r4024)
*	cleanup, remove warnings	Tim Dwyer	2006-07-17	1	-50/+3
\| \| \|	(bzr r1429)
*	remove overlaps between connected components	Tim Dwyer	2006-07-17	1	-15/+19
\| \| \|	(bzr r1425)
*	Constraints are now properly divided up between the connected components	Tim Dwyer	2006-07-17	1	-2/+13
\| \| \|	(bzr r1424)
*	Layout algorithm is now applied to each connected component in the	Tim Dwyer	2006-07-16	1	-3/+18
\| \| \| \| \| \|	selection separately. Previously, behaviour of layout on disconnected graphs was... undefined! (bzr r1421)
*	- Connectors with end-markers now constrained to point downwards in graph layout	Tim Dwyer	2006-07-14	1	-3/+3
\| \| \| \| \|	- vpsc namespace added to libvpsc (bzr r1408)
*	Previously graph layout was done using the Kamada-Kawai layout algorithm	Tim Dwyer	2006-07-12	1	-0/+242
	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)