Step 5: Abandonig all hopes and dreams
After further research and experimenting, we have decided that implementing a water simulation using the Langarian method is too advanced to manage during the short time we have left to finish the project. Further research has instead helped us find a new method that we belive could be feasible for us to implement. The so called iWave method. It is mainly based on manipulating 2D convolution, making it simple and possibly realistic for a project of our scale.
By reading the report Interactive Water Surfaces(2004) by Jerry Tessendorf, we have gotten a relatively good insight in the iWave algorithm, the math it is based on as well as how to implement it. Similarly to Kelager's report, Tessendorf explaines all math and how to implement it to code. However unlike Kelager, this report is more consise, giving us hope that it is a simpler-to-implement algorithm.
Our goal for the coming 2 days is to read more about this algorithm and try experimenting with the instructions given by Tessendorf. If successful we hope that this potential plan B of ours will replace the Langarian method we hoped to implement. As we make this switch, we are leaving Navier Stokes equation behind us, however the knowledge we have gained gives us hope that with more time we can implement Kelager's algorithm fully.
By reading the report Interactive Water Surfaces(2004) by Jerry Tessendorf, we have gotten a relatively good insight in the iWave algorithm, the math it is based on as well as how to implement it. Similarly to Kelager's report, Tessendorf explaines all math and how to implement it to code. However unlike Kelager, this report is more consise, giving us hope that it is a simpler-to-implement algorithm.
Our goal for the coming 2 days is to read more about this algorithm and try experimenting with the instructions given by Tessendorf. If successful we hope that this potential plan B of ours will replace the Langarian method we hoped to implement. As we make this switch, we are leaving Navier Stokes equation behind us, however the knowledge we have gained gives us hope that with more time we can implement Kelager's algorithm fully.
Kommentarer
Skicka en kommentar