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: Vokus Meztikora
Country: Sudan
Language: English (Spanish)
Genre: Education
Published (Last): 13 August 2016
Pages: 463
PDF File Size: 4.96 Mb
ePub File Size: 2.29 Mb
ISBN: 683-2-58685-428-8
Downloads: 54843
Price: Free* [*Free Regsitration Required]
Uploader: Kazira

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. Similar calculations are carried out to determine pixel positions along a line with negative slope. Retrieved from ” https: Computer graphics algorithms Digital geometry.

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

From Wikipedia, the free encyclopedia. In computer graphicsa digital differential analyzer DDA is hardware or software used for interpolation of variables over an interval between start and end point. The native floating-point implementation requires one addition and one rounding operation per interpolated value e. This article is about a graphics algorithm.


In fact any two consecutive point x,y lying on this line segment should satisfy the equation. By using this site, you agree to the Terms of Use and Privacy Policy. A linear DDA starts by calculating the smaller of dy or dx for a unit increment of the other.

Articles lacking in-text citations from June All articles lacking in-text citations Articles with dca C code. They can be extended to non linear functions, such as perspective correct texture mappingquadratic curvesand traversing voxels.

For the digital implementation agloritma a differential analyzer, see Digital differential analyzer. DDAs are used for rasterization of lines, triangles and polygons. For lines with slope greater than 1, we reverse the role of x and y i.

Digital differential analyzer (graphics algorithm)

June Learn how and when to remove this template message. This article includes a list of referencesrelated reading or external linksbut its sources remain unclear because it lacks inline citations. This page was last edited on 17 Julyat The fixed-point integer operation requires two additions per output cycle, and in case of fractional part overflow, one additional increment and subtraction.


Views Read Edit View history. Please help to improve this article by introducing more precise citations. Subscript k takes integer values starting from 0, for the 1st point and increases by 1 until endpoint is reached.

This process is only efficient when an FPU with fast add and rounding operation will be available. The DDA method can be implemented using floating-point or integer arithmetic.