-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
43 lines (39 loc) · 2 KB
/
index.html
File metadata and controls
43 lines (39 loc) · 2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>ALGORITHM VISUALIZER</title>
<link rel="stylesheet" href="style.css"/>
</head>
<body style="background-color: #FFFADD;">
<div class="tittle">
<div class="topic hover">
<h2 >LINE DRAWING ALGORITHM VISUALIZER</h2>
</div>
<div class="gif border"></div>
</div>
<div class="option">
<div class="box1">
<div class="head">
<p><a href="../DDA_ALGO_VISUAL/index.html">Digital Differencial Analyzer</a></p>
</div>
<div class="content">
<p>DDA (Digital Differential Analyzer) is a line drawing algorithm used in computer graphics to generate a line segment between two specified endpoints. It is a simple and efficient algorithm that works by using the incremental difference between the x and y coordinates of the two endpoints to plot the line.</p>
<p>It avoids using multiple operations which have high time complexities.</p>
<p>Due to the limited precision in the floating point representation, it produces a cumulative error.</p>
</div>
</div>
<div class="box2">
<div class="head">
<p><a href="../BRESENHAM_ALGO_VISUAL/index.html">Bresenham's</a></p>
</div>
<div class="content">
<p>Bresenham's line drawing algorithm is a second method of generating a line that was proposed after the DDA algorithm to overcome its limitations and drawbacks. It was developed by J.E. Bresenham in 1962.</p>
<p>It is faster than the DDA algorithm as it does not involves the use of heavy operations such as multiplication and division.</p>
<p>It involves only integer arithmetic. Hence, it is easier to implement.</p>
</div>
</div>
</div>
</body>
</html>