Livewire (Dijkstra's Algorithm) implemented in a GPU

This video shows my implementation of Dijkstra's algorithm through the livewire segmentation application.
My approach was using the GPU in order to parallely expand vertices just like the Delta-stepping algorithm. More details can be found at http://code.google.com/p/gpuwire/ (full thesis download) or
http://danielbaggio.blogspot.com

Category:

Science & Technology

Tags:

• gpgpu
• livewire
• segmentation
• gpu
• opengl
• dijkstra
• shortest
• path

[mit2009]

wow!!

That is a lot of work!!!

[dannyxyz22]

Thank you.

Are you into the GPGPU field?

[mit2009]

Actually I'm in college right now. Took a class that brushed on the topic - very interesting, though time consuming!

keep up the good work!

[dannyxyz22]

Thank you :)

It's nice to hear about such a topic so early. There's a long way to go :)

GPGPU looks a lot like Cell programming. It's a nice way if you want to turn your ps3 into a supercomputer, hehe...

Thanks for the comment :)

[]'s

[maxxpower2000]

Great work dannyxyz22.

Only a question... -what was the most difficult part of the project?

Best regards

[bytedildo]

wow, looks great..I don't have a clue though:)