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: Kaziktilar Mikakree
Country: Moldova, Republic of
Language: English (Spanish)
Genre: Art
Published (Last): 26 February 2012
Pages: 236
PDF File Size: 19.96 Mb
ePub File Size: 11.61 Mb
ISBN: 224-9-32061-380-2
Downloads: 49508
Price: Free* [*Free Regsitration Required]
Uploader: Shasho

This page was last edited on 17 Julyat From Wikipedia, the free encyclopedia. Views Read Edit View history.

For lines with slope algofitma than 1, we reverse the role of x and y i. Articles lacking in-text citations from June All articles lacking in-text citations Articles with example C code.

The native floating-point implementation requires one addition and one rounding operation per interpolated value e. 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.


Digital differential analyzer (graphics algorithm)

The fixed-point integer operation requires two algoriitma per output cycle, and in case of fractional part overflow, one additional increment and subtraction.

They can be extended to non linear functions, such as perspective correct texture mappingquadratic curvesand traversing voxels.

Please help to improve this article by introducing more precise citations. The DDA method can be implemented using floating-point or integer arithmetic. For the digital implementation of a differential analyzer, see Digital differential analyzer. This algorltma includes a list of referencesrelated reading or external linksbut its sources remain dxa because it lacks inline citations.

Similar calculations are carried out to determine pixel positions along a line with negative slope.

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

Subscript k takes integer values starting from 0, for the 1st point and increases by 1 until endpoint is reached. A linear DDA starts by calculating the smaller of dy or dx for a unit increment of the other. June Learn how and when to remove this template message.


Computer graphics algorithms Digital geometry. In fact any two consecutive point x,y lying on this line segment should satisfy the equation.

This process is only efficient when an FPU with fast add and rounding operation will be available. In computer graphicsa digital differential analyzer DDA is hardware or software used for interpolation of variables over an interval between start and end point.

By using this site, you agree to the Terms of Use and Privacy Policy.

DDAs are used for rasterization of lines, triangles and polygons. Retrieved from ” https: This article is about a graphics algorithm.