Analysis of Algorithm Computer Graphics Data Structures

Cohen Sutherland Line Clipping Algorithm In C

This is only the code and the output. Explanation of the code will follow soon. Stay Tuned!!
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
#include<conio.h>
#include<stdio.h>
#include<graphics.h>
#include<math.h>
void bytecode();
void sutherland();
int a[4],b[4];
float m,xnew,ynew;
float xl = 100, yl = 100, xh = 300, yh = 300,xa = 10,ya = 200,xb = 250, yb = 150;
void main()
{
  int gd = DETECT,gm;
  initgraph(&gd,&gm,"C:\\TURBOC3\\BGI");
  setcolor(5);
  line(xa,ya,xb,yb);
  setcolor(12);
  rectangle(xl,yl,xh,yh);
  m = (yb-ya)/(xb-xa);
  bytecode();
  sutherland();
  getch();
}

void bytecode()
{
  if(xa < xl)
    a[3] = 1;
  else a[3] = 0;

  if(xa>xh)
   a[2] = 1;
  else a[2] = 0;

  if(ya < yl)
   a[1] = 1;
  else a[1] = 0;

  if (ya > yh)
   a[0] = 1;
   else a[0] = 0;

  if(xb < xl)
    b[3] = 1;
  else b[3] = 0;

  if(xb>xh)
   b[2] = 1;
  else b[2] = 0;

  if(yb < yl)
   b[1] = 1;
  else b[1] = 0;

  if (yb > yh)
   b[0] = 1;
   else b[0] = 0;
}

void sutherland()
{
  printf("press a key to continue");
  getch();
  if(a[0] == 0 && a[1] == 0 && a[2] == 0 && a[3] == 0 && b[0] == 0 && b[1] == 0 && b[2] == 0 && b[3] == 0 )
  {

   printf("no clipping");
   line(xa,ya,xb,yb);
  }
  else if(a[0]&&b[0] || a[1]&&b[1] || a[2]&&b[2] || a[3]&&b[3])
  {
   clrscr();
   printf("line discarded");
   rectangle(xl,yl,xh,yh);
  }
  else
  {
   if(a[3] == 1 && b[3]==0)
   {
    ynew  = (m * (xl-xa)) + ya;
    setcolor(12);
    rectangle(xl,yl,xh,yh);
    setcolor(0);
    line(xa,ya,xb,yb);
    setcolor(15);
    line(xl,ynew,xb,yb);
   }
   else if(a[2] == 1 && b[2] == 0)
   {
    ynew  = (m * (xh-xa)) + ya;
    setcolor(12);
    rectangle(xl,yl,xh,yh);
    setcolor(0);
    line(xa,ya,xb,yb);
    setcolor(15);
    line(xl,ynew,xb,yb);
   }
   else if(a[1] == 1 && b[1] == 0)
   {
    xnew = xa + (yl-ya)/m;
    setcolor(0);
    line(xa,ya,xb,yb);
    setcolor(15);
    line(xnew,yh,xb,yb);
   }

   else if(a[0] == 1 && b[0] == 0)
   {
    xnew = xa + (yh-ya)/m;
    setcolor(0);
    line(xa,ya,xb,yb);
    setcolor(15);
    line(xnew,yh,xb,yb);
   }
  }
}


Before Clipping

After Clipping

Comments

  1. Sumedh Sen8 May 2017 at 04:14

    helpful cohen sutherland line algo

    ReplyDelete
  2. Akanksha2 November 2018 at 23:47

    What will happen when b[] ==1 you have not included that condition

    ReplyDelete
  3. Ankit Kumar30 October 2019 at 08:29

    Very very helpful to me, easy to understand

    ReplyDelete

Post a Comment

Popular posts from this blog

Graph Coloring using Backtracking in C

Image
In this, we have been given a graph G and "m" colors. We have to colour out graph in such a way that NO 2 ADJACENT NODES, i.e nodes that are connected by an edge, have the same color. 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 #include<conio.h> #include<stdio.h> int g[ 10 ][ 10 ],color[ 10 ],n; int main () { void graph( int k); void display(); int e,i,j,v1,v2; //making an adjacency matrix printf( "Enter no of vertices:" ); scanf( "%d" ,&n); printf( "Enter no of edges:" ); scanf( "%d" ,&e); for (i= 0 ;i<n;i++) { color[i] = 0 ; //setting colors of all vertices to 0 for (j= 0 ;j<n;j++) { g[i][j] = 0 ; } } printf( "Enter edges: " ); for (i= 1 ;i<=e;i++) { scanf( "%d%d" ,&v1,&v2); g[v1][v2...
Read more

Longest Common Subsequence using Dynamic Programming in C

Image
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 #include<stdio.h> #include<conio.h> #include<string.h> #define SIZE 20 void display ( char [][SIZE], char [], int , int ); void compute_LCS ( char A[], char B[]) { int m,n,i,j; int c[SIZE][SIZE]; char d[SIZE][SIZE]; m=strlen(A); n=strlen(B); for (i= 0 ;i<=m;i++) c[ 0 ][i]= 0 ; for (i= 0 ;i<=n;i++) c[i][ 0 ]= 0 ; for (i= 1 ;i<=m;i++) { for (j= 1 ;j<=n;j++) { if (A[i]==B[j]) { c[i][j]=c[i- 1 ][j- 1 ]+ 1 ; d[i][j]= '/' ; } else if (c[i- 1 ][j]>=c[i][j- 1 ]) { c[i][j]=c[i- 1 ][j]; d[i][j]= '^' ; } else { c[i][j]=c[i][j- 1 ]; d[i][j]= '<' ; } } } printf( "\nTable is...\n...
Read more