Algoritma DDA. 1. Tentukan 2 buah titik 2. Tentukan yang menjadi titik awal (X0, Y0) dan titik akhir (X1, Y1) 3. Hitung Dx dan Dy Dx = X1 – X0 dan Dy = Y1 – Y0. include #include #include void setPixel(int px, int py) { glBegin(GL_POINTS); glVertex2i(px, py); glEnd(); } void algoritmaDDA(int x1, int y1. Assalamualaikum full code: unit Garis; interface uses. Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms, Dialogs.

Author: | Kijinn Kidal |

Country: | Eritrea |

Language: | English (Spanish) |

Genre: | Software |

Published (Last): | 4 December 2007 |

Pages: | 233 |

PDF File Size: | 16.96 Mb |

ePub File Size: | 5.36 Mb |

ISBN: | 308-6-58260-482-6 |

Downloads: | 25567 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Tauktilar |

The DDA method can be implemented using floating-point or integer arithmetic. A line is then sampled at unit intervals in one coordinate and corresponding integer values nearest the line path are determined for the other coordinate. In computer graphicsa digital aogoritma analyzer DDA is hardware or software used for interpolation of variables over an interval between start and end point.

DDAs are used for rasterization of lines, triangles and polygons.

### Digital differential analyzer (graphics algorithm) – Wikipedia

For lines with slope greater than 1, we reverse the role of x and y i. This page was last edited on 17 Julyat A linear DDA starts by calculating the smaller of dy or dx for a unit increment of the other. Please help to improve this article by introducing more precise citations. Views Read Edit View history. The native floating-point implementation requires one addition dad one rounding operation per interpolated value e.

June Learn how and when to remove this template message. This article includes a list of referencesrelated reading or external links agoritma, but its sources remain unclear because it lacks inline citations.

### Membuat Garis dengan Algoritma DDA | Symphony No 1 in E Minor

The fixed-point integer operation requires two additions per output cycle, and in case of fractional part overflow, one additional increment and subtraction. For the digital implementation of a differential analyzer, see Digital differential analyzer.

Articles lacking in-text citations from June All articles lacking in-text citations Articles with example C code. Similar calculations are carried out to determine pixel positions along a line with negative slope. By using this site, you agree to the Terms of Use and Privacy Policy.

Computer graphics algorithms Digital geometry. Retrieved from ” https: This process is only efficient when an FPU with fast add and rounding operation will be available.

They can be extended to non linear functions, such as perspective correct texture mappingquadratic curvesand traversing voxels. From Wikipedia, the free encyclopedia. In fact any two consecutive point x,y lying on this line segment should satisfy the equation.

This article is about a graphics algorithm. Subscript k takes integer values starting from 0, for the 1st point and increases by 1 until endpoint is reached.