Say you have a set of points, a set of linkages between them of known length that behave like ideal springs, and a dimension count. Is there a fast algorithm for finding a minimum-energy configuration of the points and springs in the number of dimensions? All I can think of doing is simulated annealing.
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
