[ODE] Sweep-and-Prune space for ODE
Barog at pineapple-interactive.com
Fri Nov 26 00:21:56 MST 2004
I'm not sure about OPCODE's radix sort speed wise but this link might be
It contains a "Radix sort for floating point" page which has some
optimisations based on OPCODE's radix sort and claims to get some good
speed boosts, it may be doing some floating point tricks which might
need #ifdef'ing to not scare some people away.
Hope that helps!
Simon Barratt, Lead Developer, Pineapple Interactive Ltd
e: barog at pineapple-interactive.com
From: ode-bounces at q12.org [mailto:ode-bounces at q12.org] On Behalf Of
Sent: Thursday, November 25, 2004 5:13 PM
To: Brian Marshall
Subject: Re: [ODE] Sweep-and-Prune space for ODE
On the subject, I did try several implementations of Radix Sort, and the
fastest one for integers was twice as fast as std::sort. If I took that
implementation, and added Pierre's trick for handling signed floats,
maybe it would still beat std::sort after all...
ODE mailing list
ODE at q12.org
More information about the ODE