«
»

Suffix Trees and Verlet Integrators

by Mark Luffel

Bruce:
Writing a suffix tree implementation in C++
Testing on text that looks like: “aaabbabaaaabbbbabbbbbb”
Useful for searching, compression, etc similares a viagra.

Mark:
Relearning git
Implementing a mass-spring system using shape-meshing code written this weekend
Both the Euler and Verlet integrators are unstable 🙁

This entry was posted on Tuesday, November 9th, 2010 at 9:24 pm and is filed under News. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

2 Responses to “Suffix Trees and Verlet Integrators”

  1. Mark Luffel says:
    November 10, 2010 at 10:45 am

    It turns out that my timesteps were just much to large. Once I reduced them 10x, I could make the springs much stronger without everything exploding!

  2. Graham says:
    November 10, 2010 at 12:17 pm

    Hooray for stability! Nicely done.

Leave a Reply