⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 duobianxing.c

📁 计算机图形学
💻 C
字号:
 #define pi 3.141592
#define MAX(a,b) (a>b)? a:b
#define MIN(a,b) (a<b)? a:b
#include "graphics.h"
#include "math.h"
struct edge {
        int ymax;
        float x;
        float  delat;
        struct edge * pedge; };


struct point{
            float x;
            int y;};
            

struct point pot[20];
struct et {  struct edge * pedge;
             int n;};


struct edge g_aet[20];
struct edge   dge[20];
struct et   g_et[20];
struct point point1,point2;    


int ZUO(float x)
{ if((int)x==x)
   return (int)x;
  return (int)x+1;
}
int YOU(float x)
{ if((int)x==x)
   return (int)x-1;
   return (int)x;
}

int k=400,l=0,x=0,y=0;
int o=0;

void zhongxing(int x,int y,int s)
{ int i;
   for(i=x-5;i<=x+5;i++)
    {   putpixel(i,y,s);}
    for(i=y-5;i<=y+5;i++)
    {   putpixel(x,i,s);
       }
}
void init()
{int i;
for(i=0;i<=19;i++)
   {  g_aet[i].ymax=0; g_aet[i].x=0; g_aet[i].delat=0;
      g_aet[i].pedge=0;
      g_et[i].pedge=0;g_et[i].n=0;
      dge[i].ymax=0;
      dge[i].x=0;
      dge[i].delat=0;
      dge[i].pedge=0;
      pot[i].x=0;
      pot[i].y=0;}
}
void draw(int color)
{      

   int i,t,j,a,c,p,z; float b;
   struct edge temp;


  /**/for(i=k;i<=l;i++)
    {

        a=0;

         for(t=0;t<=19;t++)
           { if(g_et[t].n==i) break;}

        for(j=0;j<=19;j++)
           { if(g_aet[j].ymax==0) break;}


        if(t!=20){ g_aet[j].ymax=g_et[t].pedge->ymax;
                  g_aet[j].x=g_et[t].pedge->x;
                  g_aet[j].delat=g_et[t].pedge->delat;




            if(g_et[t].pedge->pedge!=0)
              {
                    g_aet[j+1].ymax=g_et[t].pedge->pedge->ymax;
                  g_aet[j+1].x=g_et[t].pedge->pedge->x;
                  g_aet[j+1].delat=g_et[t].pedge->pedge->delat;

            if(g_et[t].pedge->pedge->pedge!=0)
            {
                  g_aet[j+2].ymax=g_et[t].pedge->pedge->pedge->ymax;
                  g_aet[j+2].x=g_et[t].pedge->pedge->pedge->x;
                  g_aet[j+2].delat=g_et[t].pedge->pedge->pedge->delat;
            if(g_et[t].pedge->pedge->pedge->pedge!=0)
            {
                  g_aet[j+3].ymax=g_et[t].pedge->pedge->pedge->pedge->ymax;
                  g_aet[j+3].x=g_et[t].pedge->pedge->pedge->pedge->x;
                  g_aet[j+3].delat=g_et[t].pedge->pedge->pedge->pedge->delat;   }

             }
             }
            }
       for(j=0;j<=19;j++)
           { if(g_aet[j].ymax==0) break; }
               j--;

         for(t=0;t<=j;t++)

         {  for(z=0;z<=j-1;z++)

           {
            if(g_aet[z].x>g_aet[z+1].x)

             { temp.ymax=g_aet[z].ymax;
              temp.x=g_aet[z].x;
              temp.delat=g_aet[z].delat;
              g_aet[z].ymax=g_aet[z+1].ymax;
              g_aet[z].x=g_aet[z+1].x;
              g_aet[z].delat=g_aet[z+1].delat;
              g_aet[z+1].ymax=temp.ymax;
              g_aet[z+1].x=temp.x;
              g_aet[z+1].delat=temp.delat;
              }
             }
            }
 for(j=0;j<=19;j++)
           { if(g_aet[j].ymax==0) break; }
               j--;
     for(p=0;p<=j;p++)
       { a++;
         if(a%2!=0)b=g_aet[p].x;
         else
         {

           for(c=ZUO(b);c<=YOU(g_aet[p].x);c++)
              putpixel(c,i,color);}
          }

      for(t=0;t<=j;t++)
       {  if(g_aet[t].ymax==(i+1))
           {  g_aet[t].ymax=0;
           g_aet[t].x=0;
           g_aet[t].delat=0;
          }
         g_aet[t].x+=g_aet[t].delat;
       }



        for(t=0;t<=j;t++)

         {  for(z=0;z<=j-1;z++)

           {
            if(g_aet[z].x<g_aet[z+1].x)

             { temp.ymax=g_aet[z].ymax;
              temp.x=g_aet[z].x;
              temp.delat=g_aet[z].delat;
              g_aet[z].ymax=g_aet[z+1].ymax;
              g_aet[z].x=g_aet[z+1].x;
              g_aet[z].delat=g_aet[z+1].delat;
              g_aet[z+1].ymax=temp.ymax;
              g_aet[z+1].x=temp.x;
              g_aet[z+1].delat=temp.delat;
              }
             }
            }
}
}
void generate(struct point * pot)
{

int i,y,n=1,m,q,p,h;float x;

 for(h=0;h<=19;h++)
   { if(pot[h].x==0) break;}
         h--;

for(i=0;i<=h;i++)
  {

  if(n==1)
   {   point2.x=point1.x=pot[0].x;
       point2.y=point1.y=pot[0].y;
       n++;
   }
         else{     x=pot[i].x;
                y=pot[i].y;


      if(point1.y==y)   { n++; point1.x=x;  point1.y=y;  continue;}

        m=MIN(point1.y,y);

       if(x==point1.x)
             { dge[i-1].delat=0;
               dge[i-1].ymax=MAX(point1.y,y);
               dge[i-1].x=x;
               dge[i-1].pedge=0;

             for(q=0;q<=19;q++)
               { if(g_et[q].n==m) break;}
               if(q==20)
               {

               g_et[i-1].pedge=&dge[i-1];

               g_et[i-1].n=m;

               }
              else
                  {
                   if(g_et[q].pedge->pedge==0)
                          {g_et[q].pedge->pedge=&dge[i-1];
                          g_et[i-1].n=0;}
                   else
                    {  if(g_et[q].pedge->pedge->pedge==0)
                          {g_et[q].pedge->pedge->pedge=&dge[i-1];
                          g_et[i-1].n=0;}

                       else  {
                               { if(g_et[q].pedge->pedge->pedge->pedge==0)
                                  { g_et[q].pedge->pedge->pedge->pedge=&dge[i-1];

                                   g_et[i-1].n=0;}}
                          }}}}
            else
              {

               dge[i-1].delat=(float)(x-point1.x)/(y-point1.y);
               dge[i-1].ymax=MAX(point1.y,y);
               if(point1.y>y) dge[i-1].x=x;
               else {dge[i-1].x=point1.x; }
               dge[i-1].pedge=0;


               for(q=0;q<=19;q++)
               { if(g_et[q].n==m) break;}


                if(q==20)

                   {  g_et[i-1].pedge=&dge[i-1];
                      g_et[i-1].n=m;
                   }


                 else
                  {
                   if(g_et[q].pedge->pedge==0)
                          {g_et[q].pedge->pedge=&dge[i-1];
                          g_et[i-1].n=0;}
                   else
                    { if(g_et[q].pedge->pedge->pedge==0)
                          {g_et[q].pedge->pedge->pedge=&dge[i-1];
                          g_et[i-1].n=0;}

                       else  { { if(g_et[q].pedge->pedge->pedge->pedge==0)
                                    {
                                    g_et[q].pedge->pedge->pedge->pedge= &dge[i-1];

                                     g_et[i-1].n=0;}

                                   }
                       }
                      }
                    }
                 }

          p=MAX(point1.y,y);
          k=MIN(k,m);l=MAX(l,p);
            point1.x=x;
            point1.y=y;

             n++;}

 }
 if(point1.y==point2.y) return;
          else 
          {if(point2.x==point1.x){
           dge[i-1].delat=0;
           dge[i-1].ymax=MAX(point1.y,point2.y);
           dge[i-1].x=point2.x;}
            else 
            { dge[i-1].ymax=MAX(point1.y,point2.y);
             if(point1.y>point2.y) dge[i-1].x=point2.x;
             else {dge[i-1].x=point1.x;}
             dge[i-1].delat=(float)(point2.x-point1.x)/(point2.y-point1.y);
             }
          }


      m=MIN(point1.y,point2.y);
      k=MIN(k,m); l=MAX(l,dge[i-1].ymax);

      for(q=0;q<=19;q++)
               { if(g_et[q].n==m) break;}


                if(q==20)

                   {  g_et[i-1].pedge=&dge[i-1];
                      g_et[i-1].n=m;
                   }


                 else
                  {
                   if(g_et[q].pedge->pedge==0)
                          {g_et[q].pedge->pedge=&dge[i-1];
                          g_et[i-1].n=0;}
                   else
                    {
                     if(g_et[q].pedge->pedge->pedge==0)
                          {g_et[q].pedge->pedge->pedge=&dge[i-1];
                          g_et[i-1].n=0;}

                     else { if(g_et[q].pedge->pedge->pedge->pedge==0)

                       {g_et[q].pedge->pedge->pedge->pedge= &dge[i-1];

                        g_et[i-1].n=0;
                        }
                       }
                    }
                    }

}
void add(int x,int y,int i)
{
pot[i].x=x;
pot[i].y=y;
}
void main()
{int driver=DETECT,mode; int i=0,j,key;
 registerbgidriver(EGAVGA_driver);
 initgraph(&driver,&mode,"\\tc");
initgraph(&driver,&mode,"\\tc");
 zhongxing(x,y,4);
   setcolor(3);
/**/for(;;)
 { if(bioskey(1))

   { key=bioskey(0);
   if(key==0x4d00)
     {  zhongxing(x,y,0);
       x+=5;
        zhongxing(x,y,4);
     }

   if(key==0x011b)
   {printf("esc be press");
   break;
   }

  if(key==0x4b00)
   {  if(x!=40){
      zhongxing(x,y,0);
       x-=5;
       zhongxing(x,y,4); }



    }
   if(key==0x5000)
      {
       zhongxing(x,y,0);
       y+=5;

       zhongxing(x,y,4);
         }
    if(key==0x4800)
      {
        zhongxing(x,y,0);
       y-=5;
       zhongxing(x,y,4);
        }
     if(key==0x1c0d)
     {
        add(x,y,i);
        circle(x,y,3);
         i+=1;  }
     if(key==0x3920)

     {  generate(pot);
       draw(2);
       init();
        i=0;
        }

 }
 }
getch();

closegraph();
}


⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -