|
Hum. Thats an interesting approach. It helps the animation effect for sure,
but to apply this in a WPF context ?
And what if there are other kinds of objects around ? Bullets hitting each other ?
Walls being hit ? (well, if this matters it needs a solution anyhow).
|
|
|
|
|
How can I use Runge Kutta algorithm to programme a fractal?
Noha.Y
|
|
|
|
|
long time ago I used Runga-Kutta for numerical integration.
I dont see the use/need for it in fractals...
|
|
|
|
|
The use of runge kutta method is for dynamical systems, and fractals are dynamical systems..
My question now is: how did you use Runga Kutta for numerical integration?
Noha.Y
|
|
|
|
|
I once wrote a simulator for electronic circuits (a precursor of Spice);
using Fortran, the high-level language at that time.
for "time analysis" one has to cope with the intgerating effect of capacitors
and inductors; this is where different integration techniques can be useful,
e.g. Runge-Kutta.
You can find more on RK through Google, for instance here[^]
|
|
|
|
|
Thank you very much
It helped me!
But what if I want to write a program??
|
|
|
|
|
Hi Luc,
I used Spice in college. Are you an author?
Jeff
|
|
|
|
|
No I am not an author of Spice, I met some of its authors when visiting Berkeley
University tho. And I participated in the development of similar programs in
Belgium, and did one myself. At that time SPICE (SPICE 1 that is) missed several
features that we needed badly, mostly in frequency analysis(poles and zeroes,
impedance calculation, S-parameters ...).
|
|
|
|
|
RK is used for approximating solutions to differential equations, which don't really have anything to do with fractals.
Do you have any particular reason to try and program something using Runge-Kutta or fractals? If you explain what you want to do a bit better, I might be able to point you in the right direction.
|
|
|
|
|
OK.. Can you give your email to send for you the mission I have to do?
Mine is: noha.yassin@gmail.com
Thanks
Noha.Y
|
|
|
|
|
i wish to learn about timetabling problem. From the surface, it does look quite easy to understand. but i don't really understand how does algorithm such as GA/SA/ACO can solve the problem? I mean, how to apply those algorithm into the problem?
|
|
|
|
|
Have you figured it out yet? Or are you still working on it?
"Any sort of work in VB6 is bound to provide several WTF moments." - Christian Graus
|
|
|
|
|
Hello,
I'm trying to develop an application that handles 3D data and plots it using OpenGl.
Do you know of any good 3D Math library to use with c#?
For OpenGl I will try to use Tao Framework.
By the way, in case this is not the rigth forum, where should I post this?
Thanks in advance
Just a c# newbie
-- modified at 19:05 Tuesday 26th June, 2007
|
|
|
|
|
|
Hello folks,
I have a task to convert an image (regardless of the color depth) to a 1 bit-per-pixel (bpp) image. (e.g image that is being transmitted over a fax machine)
The thing is I don't have a good dithering algorithm such that the result of my conversion is really crap in my opinion.
I know there are few algorithms out there, but I don't know which one is "considered" the best.
More importantly, I do not have the source code/sample that goes with the algorithm.
Would someone helping me with known algorithm that does this?
|
|
|
|
|
Thanks for the help.
What about atkinson dithering? is it any good? some say that it's better (although not as popular) than Floyd-Steinberg.
|
|
|
|
|
I don't know what you are encoding, but standard jpeg compression gives good quality at 1 bit per pixel. You should be able to find a photo editor or similar to play around with the compression ratios for testing.
Peter
"Until the invention of the computer, the machine gun was the device that enabled humans to make the most mistakes in the smallest amount of time."
|
|
|
|
|
Ive allways liked playing around wih SetPixel and GetPixel, this time ive created a quite nice and simple pattern drawer, only using the SetPixel, GetPixel and some very simple math ( pow(), cos() sin() tan() modulo, * / + - ).
It fills up the screen with varius drawing methods using a formula.
Here[^] (2.49MB) is an example of my latest pattern.
I wonder, can this be considerd as a simple algorithm?
//Johannes
|
|
|
|
|
Probably.
From Wikipedia: an algorithm is a finite list of well-defined instructions for accomplishing some task that, given an initial state, will terminate in a defined end-state.
Seems to match.
Is it simple ?
Johpoke wrote: some very simple math
You claim it is, so it is.
But then sooner or later some one may come up with something simpler
that produces the same result...
|
|
|
|
|
Actually I see only an Image...
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
|
|
|
|
|
Luc Pattyn wrote: But then sooner or later some one may come up with something simpler
that produces the same result...
I meant that i dont use any advanced functions for mathematics.
the drawing code itself is kinda insane and the whole project would probably land in coding horrors if i where to release it
//Johannes
|
|
|
|
|
|
If I recall correctly, Trig is high school level mathematics which does not make it advanced by today's standards.
|
|
|
|
|
...usually basic arithmetic on integers produces also real number results...
(or your basic arithmetic operators are just + and - }?)
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
|
|
|
|
|