Moving Wheel using Mid-Point Circle algorithm and DDA Line algorithm

On October 19, 2008, in Animation, Drawing, by , Views : 12931


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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include<stdio.h>
#include<conio.h>
#include<graphics.h>
#include<math.h>
#include<dos.h>
 
int l = 1;
 
void ddaline(int x1, int y1, int x2, int y2)
{
 
    int s, dx, dy, m;
    float xi, yi, x, y;
 
    dx = x2 - x1;
    dy = y2 - y1;
 
    if (abs(dx) > abs(dy))
	s = abs(dx);
    else
	s = abs(dy);
 
    xi = dx / (float) s;
    yi = dy / (float) s;
 
    x = x1;
    y = y1;
 
    putpixel(x1 + 0.5, y1 + 0.5, 15);
 
    for (m = 0; m < s; m++) {
	x += xi;
	y += yi;
	putpixel(x + 0.5, y + 0.5, 15);
    }
}
 
 
void plotpoints1(int x, int y, int cx, int cy)
{
    putpixel(cx + x, cy + y, 15);
    putpixel(cx - x, cy - y, 15);
    putpixel(cx - y, cy + x, 15);
    putpixel(cx + y, cy - x, 15);
    if (l % 20 == 0) {
	ddaline(cx - x, cy - y, cx + x, cy + y);
	ddaline(cx - y, cy + x, cx + y, cy - x);
    }
    l++;
}
 
void plotpoints2(int x, int y, int cx, int cy)
{
 
    putpixel(cx - x, cy + y, 15);
    putpixel(cx + x, cy - y, 15);
    putpixel(cx + y, cy + x, 15);
    putpixel(cx - y, cy - x, 15);
    if (l % 20 == 0) {
	ddaline(cx + x, cy - y, cx - x, cy + y);
	ddaline(cx - y, cy - x, cx + y, cy + x);
    }
    l++;
}
 
 
void mcircle(int cx, int cy, int r)
{
    int x = 0, y, p;
 
    y = r;
    p = 1 - r;
 
 
    while (x < y) {
	plotpoints1(x, y, cx, cy);
	x++;
	if (p < 0)
	    p += 2 * x + 1;
	else {
	    y--;
	    p += 2 * (x - y) + 1;
	}
    }
 
 
 
    x = y + 1;
    while (abs(x) > 0) {
	plotpoints2(x, y, cx, cy);
	x--;
	if (p >= 0)
	    p = p - 2 * x - 1;
	else {
	    y++;
	    p = p - 2 * (x - y) - 1;
	}
    }
}
 
void main()
{
    int gd = DETECT, gm = DETECT;
    int i = 0;
    initgraph(&gd, &gm, "");
 
    while (!kbhit()) {
	if (i > 640)
	    i = -200;
	cleardevice();
	mcircle(100 + (i++), 200, 100);
	delay(90);
	i++;
    }
    getch();
}
 
/******************************************************************/
/*                       WWW.CGLABPROGRAMS.COM                    */
/******************************************************************/

Hope, it helps! 🙂



8 Responses to Moving Wheel using Mid-Point Circle algorithm and DDA Line algorithm

  1. Aswathi says:

    hai thank u for ur cg prgms..
    am studyng in college of engineering thalassery…
    our cg lab s worseeee
    will u please help me with some questions?

  2. Shivani says:

    thank you dipin, your programs have been a great help in my cg lab work.

  3. nidhi says:

    thanks a lot..your programs helped me improve my grades..and even my approach to coding..

  4. nidhi says:

    hi..thnks for the c odes..it helped to get a better approach towards coding

  5. zeve leroy says:

    Thanks for the code.i just need to make a program of moving car from one place to another.May little bit addition in this program help me???

  6. vishkha says:

    thanks a lot ths code helps me in my project

  7. Muhammad YouSaf says:

    amazing………very thankful to u…………..

  8. danesh raja(osthi) says:

    hi vibin thank u so much easy to understand for your programes….

Leave a Reply

Your email address will not be published. Required fields are marked *


*

Looking for something?

Use the form below to search the site:

Still not finding what you're looking for? Drop a comment on a post or contact us so we can take care of it!

Visit our friends!

A few highly recommended friends...

  • Dipin Krishna

Archives

All entries, chronologically...

Read more:
line
Bresenham’s Line Drawing Algorithm

line
DDA Line Drawing Algorithm in C

Car
Car movement during Traffic Signal

MinMaxClose