Boundary detection

Case number:845833-990296
Topic:Game: Display
Opened by:Seagat2011
Opened on:Thursday, September 1, 2011 - 21:52
Last modified:Thursday, September 1, 2011 - 21:52

If foldit uses the Lemke algorithm to perform boundary detection, it may be more efficient to implement a variant of the Murty algorithm, termed the Boxed Linear Complementarity Problem. The performance arises from the velocity term, friction and force terms being bounded to a set of constraints; another benefit is that both epsilon and gamma terms can be used to model stiff springs (potential energy functions) without any additional parameters or programming.

(Thu, 09/01/2011 - 21:52  |  0 comments)


Developed by: UW Center for Game Science, UW Institute for Protein Design, Northeastern University, Vanderbilt University Meiler Lab, UC Davis
Supported by: DARPA, NSF, NIH, HHMI, Amazon, Microsoft, Adobe, Boehringer Ingelheim, RosettaCommons