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: Gular Tygorn
Country: Liechtenstein
Language: English (Spanish)
Genre: Art
Published (Last): 26 April 2007
Pages: 301
PDF File Size: 12.70 Mb
ePub File Size: 13.26 Mb
ISBN: 281-4-39218-873-8
Downloads: 94917
Price: Free* [*Free Regsitration Required]
Uploader: Maurisar

This article is about a graphics algorithm.

For lines with slope greater than 1, we reverse the role of x and y i. Retrieved from ” https: Subscript k takes integer values starting from 0, for the 1st point and increases by 1 until endpoint is reached.

Digital differential analyzer (graphics algorithm) – Wikipedia

A line is then akgoritma at unit intervals in one coordinate and corresponding integer values nearest the line path are dda for the other coordinate. This page was last edited on 17 Julyat June Learn how and when to remove this template message. DDAs are used for rasterization of lines, triangles and polygons. Articles lacking in-text citations from June All articles lacking in-text citations Articles with example C code. In fact any two consecutive point x,y lying on this line segment should satisfy the equation.


In computer graphicsa digital differential analyzer DDA is hardware or software used for interpolation of variables over an interval between start and end point. They can be extended to non linear functions, such as perspective correct algoritmma mappingquadratic curvesand traversing voxels.

The native floating-point implementation requires one addition and one rounding operation per interpolated value e.

Digital differential analyzer (graphics algorithm)

This article includes a list of referencesrelated reading or external linksbut its sources remain unclear because it lacks inline citations. A linear DDA starts by calculating the smaller of dy or dx for a unit increment of the other.

From Wikipedia, the free encyclopedia. This process is only efficient when an FPU with fast add and rounding operation will be available.

Similar calculations are carried out to determine pixel positions along a line with negative slope. Views Read Edit View history.

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

The DDA method can be implemented using floating-point or integer arithmetic. Please help to improve this article by introducing more precise citations.


By using this site, you agree to the Terms of Use and Privacy Policy. Computer graphics algorithms Digital geometry. 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 ddda of a differential analyzer, see Digital differential analyzer.