Hi !
Featured games (85)
games approved by the League of Dukes
Games in Showcase (623)
Games in Android Showcase (176)
games submitted by our members
Games in WIP (676)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
    Home     Help   Search   Login   Register   
Pages: [1]
  ignore  |  Print  
  I search speed algorithm sorter for paint  (Read 2490 times)
0 Members and 1 Guest are viewing this topic.
Offline lbrinon

Junior Newbie

Java games rock!

« Posted 2002-10-31 10:12:17 »


I search a speed sorted paint algorithm for my group of sprites.

have you a example or tips ?

thank you

Offline Captain-Goatse

Junior Devvie

I suck at teh 2D. XBOX IS BIG LOL!111

« Reply #1 - Posted 2002-10-31 10:43:15 »

Excuse me, but could you explain a little bit more in detail. That would help a lot.
Offline lbrinon

Junior Newbie

Java games rock!

« Reply #2 - Posted 2002-10-31 11:07:17 »

ha sorry for my english.

is for paint one sprite on foreground or background of other sprites depending of the location of sprite on map.

in iso map this :
Games published by our own members! Check 'em out!
Legends of Yore - The Casual Retro Roguelike
« Reply #3 - Posted 2002-11-01 05:07:03 »

The Quicksort-algorithm is very fast (as the name lets you expect.), but i never testet out yet if its fast enough for sorting your Sprites each frame...

Offline Themroc

Junior Devvie

« Reply #4 - Posted 2002-11-01 09:54:01 »

Seems like you have only few fixed positions where the sprites can be positioned, not on every single pixel?
Depending on the number of sprites and number of possible positions you may also try a bucketsort.

1) If you only care for correct y-drawing and not for the way in whic they overlap in x direction, then create as many vectors/arraylists/arrays (what seems best) as you have positions in y and put them in there according to their y-coordinate and then draw each array. Time is 2*n for n sprites
2) If your care for x-overlapping: make an 2dim array as big as your field. On each sorting set each element to null, then insert the sprites, then run linear through the field again and draw as needed. Time is 2*m+n (m number of fields/possible positions). If this is good really depends on the relative size of m to n. If you have few sprites but many fields it will be slower than a standrad sort.
3) Or simpy use the Collection sort algorithm. Should be as fast as any handcrafted  n*log n sort algorithm.
Pages: [1]
  ignore  |  Print  
You cannot reply to this message, because it is very, very old.

BurntPizza (9 views)
2015-10-06 17:11:23

KaiHH (12 views)
2015-10-06 11:22:20

KaiHH (11 views)
2015-10-06 10:41:59

BurntPizza (23 views)
2015-10-06 10:04:48

basil_ (44 views)
2015-09-30 08:04:40

shadowstryker (22 views)
2015-09-29 06:55:06

TheSpaceHedgehog (28 views)
2015-09-28 16:58:48

GamerC4 (54 views)
2015-09-24 12:10:38

GamerC4 (71 views)
2015-09-24 12:09:48

htuy (28 views)
2015-09-23 19:57:24
Math: Inequality properties
by Roquen
2015-10-01 04:30:46

Math: Inequality properties
by Roquen
2015-09-30 07:06:05

HotSpot Options
by Roquen
2015-08-29 02:33:11

Rendering resources
by Roquen
2015-08-17 03:42:29

Rendering resources
by Roquen
2015-08-17 00:36:56

Rendering resources
by Roquen
2015-08-12 22:40:51

Networking Resources
by Roquen
2015-08-12 22:40:43

List of Learning Resources
by gouessej
2015-07-09 02:29:36 is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!