[Papervision3D] GridPlane object

[Jon Bradley]

I might be remembering things wrong but native sorting in Flash is  
running compiled-in-the-player AS.

It's the same thing as the Matrix classes - they're intrinsic classes  
written and compiled into the Flash Player. They're not C/C++ as far  
as I know.

If they were - then someone over at Adobe needs a flogging for  
creating such a slow sorting algorithm in a compiled language. :)

Did I read that wrong?

- Jon

On Jan 3, 2007, at 10:31 AM, jakelewis wrote:

> I cant be sure of the implementation of the flash sorting process,  
> but its very likely that the efficiency is N*ln(N), that is, number  
> of elements * the natural logarithm of the number of elements.
>
> Hence 2000 elements = 2000 * 7.6* 1 = 15202
> 20 sets of 100 elements =  100* 4.6 * 20 = 9210
>
> so the 20 * 100 elements sorts in about 60% of the time of 2000  
> elements. But the elements would not be as well sorted, as there  
> would be no sorting between groups of elements.
>
> Sorting and drawing discreet elements will be more cache friendly,  
> particularly with large textures.
>
> The sorting is done in native code not actionscript, so I doubt the  
> poly count will have anywhere near the effect on the sorting as it  
> does on transform, projection etc.
>
> Jake
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://osflash.org/pipermail/papervision3d_osflash.org/attachments/20070103/5ecabf53/attachment.htm