All these good theoretical considerations aside, it will be interesting to see how the winding number algorithm performs on actual data.
On Thu, Apr 22, 2010 at 6:52 PM, Boyko Bantchev <[email protected]> wrote: > On 23 April 2010 00:02, Bo Jacoby <[email protected]> wrote: > > The winding number program (%&0j2p1)@(+/)@:^.@(% _1&|.) is not "slow, > unstable, and incomplete (hence buggy)". > > Of course it is. It does not handle boundary cases. It uses too > complicated operations, introducing inaccuracy and unstability > where it – by the nature of the problem – should absolutely not. > That same operations make it slow, too. > ... -- Devon McCormick, CFA ^me^ at acm. org is my preferred e-mail ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
