wildbill:
I'm still not sure whether you're looking for straight lines or curves, but if you simply want to go from x1,y1 to x2,y2, take a look at Bresenham's algorithm.
thanks for the tip. My first goal is to go in a straight line from A to B. Therefor Bresenham is indeed pretty useful.
But i want to go further. Not just linar graphs but also curves and x^2 , x^3 etc.
therefor i need a ultimative solution to get to those points wich i want to do with as many points in between the start and ending point as possible.
if i go directly from A to B i dont get a straight line, but if i go from A to a lot of points on the straight line from A to B and the last one is B i get a pretty nice straight line. thats what my solution is about right now