Comments for infinite turtles

Comment on Away Media: Morgan Stanley Matrix microsite by Alperian

Alperian — Wed, 10 Mar 2010 10:42:38 +0000

I would love to know what the brief was. How did they know how the libraries would help them realise this?

Comment on Fast sorting in AS3 by Joe

Joe — Tue, 09 Mar 2010 21:57:00 +0000

Hey Rob.

This is probably a newbish question, but I’ve always been taught quicksort is usually the fastest sort method, why is it not in this case?

Cheers
Joe

Comment on Away3D Lite: banishing the darkness by Joe

Joe — Tue, 09 Mar 2010 14:26:53 +0000

1. Is this faster than alternativa?

2. I myself made a pretty simple 3D engine a while back (on my site for you to check out and optionally laugh at!), and had some big problems with frame rate hitting the floor when I zoomed in on an object enough for it to fill the screen, any quick pointers? I’m not looking to make the next Away3D, I just love doing this stuff for fun.

Comment on Flash on the Beach ‘08 by madhu osem

madhu osem — Sun, 07 Feb 2010 03:25:19 +0000

username is madhu.osem @ educomp.com

Comment on Away3d: MultiMario! by Julian

Julian — Fri, 05 Feb 2010 19:16:09 +0000

Rob, I wanted to ask for a tutorial, I want to make a game with flash, I’ve already created many thins, and also imported and animated mario (all thanks to many tutorials and codes from the net, yours too, and I thank that). I wanted to make my own characters, I have maya8.5 and collada 3.05B, but I cannot export and load into flash a single box… I would like to now how to make the export for flash, i couldn’t find tutorials on that

Comment on Fast sorting in AS3 by Sharedtut

Sharedtut — Wed, 03 Feb 2010 14:18:09 +0000

Great job, thank you for sharing.

Comment on Fast sorting in AS3 by Stephane Rainville

Stephane Rainville — Tue, 19 Jan 2010 04:49:45 +0000

I’m bit late to the discussion but I recently encountered the sort issue in Flash. Did some testing and like yourself found out that vector.sort is unbelievably slow compared to Array.sortOn(someFieldName, Array.DESCENDING | Array.NUMERIC) which is really really fast, more than all AS3 manual sort code I could find.

Now you say vector.sorton which I dont’t think exists. Did you mean array.sortOn or am I missing something comletely obvious?

Cheers for Away3DLite byt the way!

Comment on Away3d & the FLARToolkit by Jorge Andrés Cañón Sierra

Jorge Andrés Cañón Sierra — Tue, 12 Jan 2010 21:31:30 +0000

Parceros, está del pts. ¡Gracias!
Luego de unas modificaciones simplemente “it works”, lo trabajé con:
+ Flash Builder 4 Premium Beta
+ Away3D_3.3.4.swc

att: jacanon7@gmail.com

Comment on Fast sorting in AS3 by Martin

Martin — Sun, 10 Jan 2010 23:22:41 +0000

Hi Rob!
This Looks really neat, but as I am new to 3D in Flash I got 2 questions:

1) this line:
p = vectorToSort[int(j-1)];
This is the actual element, that I would need to keep adding into a new array, if I wanted them to be added ordered via their z-Depth, correct?

2) Am i right to assume, that this algorithm doesn’t work 100% reliably with large numbers?? As if I increase the randomness of .z property, the larger they get the more mistakes it ll have in their ordering?

Comment on Fast sorting in AS3 by raptros-v76

raptros-v76 — Tue, 22 Dec 2009 17:13:29 +0000

From a theoretical perspective, insertion sort is linear to the number of items in the list in the case where the list is sorted, and is quadratic (i.e. it runs n^2 constant sets of operations) when the list is unsorted, or in reverse order. The best running time for a purely fair (i.e. only uses comparisons) sorting algorithm is O(n*log(n)): either mergesort (which is stable, but has possible extra memory use or quicksort (which is space efficient, but is not necessarily stable and is difficult to implement properly). Radix sort runs it linear time relative to the number of items being sorted, but has a constant multiplier involving the numbers of digits times the number of buckets.
Also, I don’t see there being any benefits in using a linked list - it has linear access time for items in the list. Using an array and swapping references at indexes (rather than inserting into the array) is a much better idea because then you have constant time accesses for items in the array and constant time move operations.