Author Topic: Barnsley's Fern & Sierpinski's Triangle  (Read 12556 times)

0 Members and 1 Guest are viewing this topic.

wizman

  • Bull Frog
  • Posts: 290
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #15 on: February 20, 2010, 07:35:05 PM »
Excellent Lee, thanks for sharing :-)

Lee Mac

  • Seagull
  • Posts: 12906
  • London, England
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #16 on: February 20, 2010, 07:46:26 PM »
Excellent Lee, thanks for sharing :-)

Thanks Wizman  :-)

Lee Mac

  • Seagull
  • Posts: 12906
  • London, England
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #17 on: February 20, 2010, 08:50:34 PM »
I have added a quick program to the first post, allowing you guys to create your own fractals, (that use three rules) - for example the Sierpinski Triangle and other variations  :-)

Lee

pkohut

  • Guest
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #18 on: February 20, 2010, 08:56:19 PM »
Just ran them locally, and will repeat my earlier comment - Nice!!

It occurs to me that these might be good candidates for someone wanting to learn CUDA. Any volunteers?  :kewl:

Lee Mac

  • Seagull
  • Posts: 12906
  • London, England
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #19 on: February 20, 2010, 09:00:36 PM »
Just ran them locally, and will repeat my earlier comment - Nice!!

It occurs to me that these might be good candidates for someone wanting to learn CUDA. Any volunteers?  :kewl:

Thanks Paul  8-)

Not heard of CUDA before, but is that the technique of encoding complicated graphics using 'rules' that define iterated maps, so that instead of a bitmap format, the graphic size is reduced? Or am I way off the mark...

pkohut

  • Guest
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #20 on: February 20, 2010, 09:36:54 PM »
Instead of the algorithms being CPU bound, you have the GPU do the computations instead.
So instead of doing the loop X number of times (50000 in your app) you set up a pipeline
and send it to the GPU which does Y number of computation in parallel (I think, based on
the number of GPU cores???, maybe more based on the number of shaders???).

http://www.nvidia.com/object/cuda_home_new.html

hermanm

  • Guest
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #21 on: February 20, 2010, 10:21:40 PM »
Why spend your time learning technology which is hardware-specific?

http://en.wikipedia.org/wiki/CUDA

Quote
Unlike OpenCL, CUDA-enabled GPUs are only available from NVIDIA (GeForce 8 series and above, Quadro and Tesla).[

http://en.wikipedia.org/wiki/OpenCL

Quote
OpenCL gives any application access to the Graphical Processing Unit for non graphical computing.

Personally, I am using an ATI card and am quite happy with it.


pkohut

  • Guest
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #22 on: February 21, 2010, 12:25:51 AM »
Why spend your time learning technology which is ?

http://en.wikipedia.org/wiki/CUDA

Quote
Unlike OpenCL, CUDA-enabled GPUs are only available from NVIDIA (GeForce 8 series and above, Quadro and Tesla).[

http://en.wikipedia.org/wiki/OpenCL

Quote
OpenCL gives any application access to the Graphical Processing Unit for non graphical computing.

Personally, I am using an ATI card and am quite happy with it.



Ouch. Bit testy, eh?  Anyways, OpenCL would be a fine choice to learn as well. The idea is to explore outside ones normal boundaries.

Lee Mac

  • Seagull
  • Posts: 12906
  • London, England
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #23 on: February 21, 2010, 09:38:10 AM »
3 Rules is OK, but you can get even more variation with the choice of two or three - and a choice of colour  8-)

First post updated  :-)

Enjoy!

Lee

Lee Mac

  • Seagull
  • Posts: 12906
  • London, England
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #24 on: February 21, 2010, 01:29:33 PM »
Found a small bug - bug squashed, code updated.  8-)

Lee Mac

  • Seagull
  • Posts: 12906
  • London, England
Re: Barnsley's Fern & Sierpinski's Triangle
« Reply #25 on: February 21, 2010, 06:04:27 PM »
One more  8-)