Which is in your opinion the fastest available Delaunay triangulation algorithm for GPU? Or more general, in parallel
Which is in your opinion the fastest available Delaunay triangulation algorithm for GPU? Or
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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.