while (p! =NULL) j[0]=x j[1]=s[1]+(p->dy-s[1])*(x-s[0])/(p->dx-s[0]+0.1) max-s [0] min=p->dx if (s[o]p->dx)I max=p->dx min=s[OJ f((j[0]>=min)&(j[0]<=max) i g=(struct node *)malloc (LEN >dx=j[O] q->dy=j[l] if(hh==NULL else r->next= r-q, if (p->dx<=x) i g=(struct node *)malloc(LEN) g->dx=p->dx g->dy=p->dy if (hh==NULL) else r->next=q r-g, s[0]=p->dx p=p->next j[0]=x j[1]=s[1]+(p->dy-s[1])*(x-s[0])/(p->dx-s[0]+0.1) max=s [0] min=p->dx if (s[o]<p->dx) max=p->dx min=s [O] if(j[0]>=min)&&(j[0]<=max)) I g=(struct node *)malloc(Len) g->dx=j[O] g->dy=j[l]p=p->next; while (p!=NULL) { j[0]=x; j[1]=s[1]+(p->dy-s[1])*(x-s[0])/(p->dx-s[0]+0.1); max=s[0]; min=p->dx; if (s[0]<p->dx) { max=p->dx; min=s[0]; } if ((j[0]>=min)&&(j[0]<=max)) { q=(struct node *)malloc(LEN); q->dx=j[0]; q->dy=j[1]; if (hh==NULL) hh=q; else r->next=q; r=q; } if (p->dx<=x) { q=(struct node *)malloc(LEN); q->dx=p->dx; q->dy=p->dy; if (hh==NULL) hh=q; else r->next=q; r=q; } s[0]=p->dx; s[1]=p->dy; p=p->next; } p=h; j[0]=x; j[1]=s[1]+(p->dy-s[1])*(x-s[0])/(p->dx-s[0]+0.1); max=s[0]; min=p->dx; if (s[0]<p->dx) { max=p->dx; min=s[0]; } if ((j[0]>=min)&&(j[0]<=max)) { q=(struct node *)malloc(LEN); q->dx=j[0]; q->dy=j[1];