If you are only given one endpoint and a midpoint, you know what the middle of the line segment is. Since the midpoint is half of what the line segment's length is, all you have to do is find the distance between the endpoint given and the midpoint, then add that coordinate to your midpoint and get your other endpoint. For example: Endpoint A: (4,5) Midpoint: (6,8) Distance between: (2,3) Add (2,3) to (6,8) and get Endpoint B: (8,11).
midpoint
how do you find distance between points
It is the apex of the parabola.
It is the midpoint
what is difference between mid-point and bresenhams circle algorithm what is difference between mid-point and bresenhams circle algorithm bresenhams circle algorithm results in a much more smoother circle,comparred to midpoint circle algorithm..In mid point,decision parameter depends on previous decision parameter and corresponding pixels whereas in bresenham decision parameter only depends on previous decision parameter...
These two algorithms are almost completely different. The only real similarity is that they are each designed to use only integer addition/subtraction and multiplication, avoiding expensive division and floating point operations.
AnswerDDA uses float numbers and uses operators such as division and multiplication in its calculation. Bresenhams algorithm uses ints and only uses addition and subtraction. Due to the use of only addition subtraction and bit shifting (multiplication and division use more resources and processor power) bresenhams algorithm is faster than DDA in producing the line. Im not sure, though if i remember right, they still produce the same line in the end.One note concerning efficiency: Fixed point DDA algorithms are generally superior to Bresenhams algorithm on modern computers. The reason is that Bresenhams algorithm uses a conditional branch in the loop, and this results in frequent branch mispredictions in the CPU. Fixed point DDA also has fewer instructions in the loop body (one bit shift, one increment and one addition to be exact. In addition to the loop instructions and the actual plotting). As CPU pipelines become deeper, mispredictions penalties will become more severe.Since DDA uses rounding off of the pixel position obtained by multiplication or division, causes an accumulation of error in the proceeding pixels whereas in Bresenhams line algorithm the new pixel is calculated with a small unit change in one direction and checking of nearest pixel with the decision variable satisfying the line equation.BUT this error can be calculated and will not cause problems for typical line drawing applications. Lines longer than what fits on a typical computer screen (a few thousand pixels) will be identical to Bresenham lines when using 32 bit integers. Fixed point DDA also has another advantage: Since it does not require conditional jumps, you can compute several lines in parallel with SIMD (Single Instruction Multiple Data) techniques.
34 is the midpoint between 12 and 56.
midpoint between 4-16
midpoint between 4-16
0.045 is the midpoint between those two values.
A midpoint of anything is the point exactly halfway between the beginning point and the end point. So logically, it is the "midpoint".
(1,1) is the midpoint between (0,0) and (2,2)
The midpoint is the point between the beginning and the end, in distance or in time.
The exact midpoint is a little south of Nashville, TN.
what is the midpoint between 9.9 and 10