Suffix Trees and Verlet Integrators

by Mark Luffel

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

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

2 Responses to “Suffix Trees and Verlet Integrators”

  1. Mark Luffel says:

    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:

    Hooray for stability! Nicely done.

Leave a Reply