We closed this forum 18 June 2010. It has served us well since 2005 as the ALPHA forum did before it from 2002 to 2005. New discussions are ongoing at the new URL http://forum.processing.org. You'll need to sign up and get a new user account. We're sorry about that inconvenience, but we think it's better in the long run. The content on this forum will remain online.
IndexProcessing DevelopmentLibraries,  Tool Development › fvlib: A fast point-spring solver
Page Index Toggle Pages: 1
fvlib: A fast point-spring solver? (Read 1444 times)
fvlib: A fast point-spring solver?
Mar 31st, 2010, 8:03am
 
fvlib is essentially a minimalistic point-spring solver library, built with high-performance in mind. It uses Verlet Integration for the calculation of point trajectories and Dynamic Relaxation for the calculation of constraints.

Using the 'fast' option, the library has been tested on a set of 9800 points and 58779 links. Using 15 steps, each iteration was measured to 20-24 msec (using java's System.currentTimeMillis()), on a 2.2GHz Intel Core 2 Duo. In other words, about a million point and spring loops can be performed in realtime on a typical contemporary computer.

You can find out more in my weblog,
http://prototy.blogspot.com

If you end up using it (or trying to!), please post any comments/problems/bugs you encounter. This is my first effort in creating a library for Processing, so I tried to keep it simple, but would really appreciate any feedback.

Thanks.
Re: fvlib: A fast point-spring solver?
Reply #1 - Mar 31st, 2010, 10:12am
 
Awesome, Thanks!
Page Index Toggle Pages: 1