Which is in your opinion the fastest available Delaunay triangulation algorithm for GPU? Or more general, in parallel
Be careful with GPU's: Delaunay Triangulations require orientation tests. These do not work reliably with floating point arithmetic, and it might be hard to cope with that problem using a GPU. Also the memory management is crucial.
You might want to try http://www.geom.at/fade2d/html/ which is among the fastest robust single threaded implementations.