struct node *builyy(h, y) struct node *h Int y struct node *hh, *p *r, *q nt max, min; hh=NULL [0]=p->dx s[1]=p->d p=p->next while (p!=NULL) i[0]=s[0]+(p)dx-s[0])*(y-s[1])/(p->dy-s[1]+0.1) max=s[1l min=p->dy f(s[1]<p->dy)i max=p->dy min=s[1l if ((j[1]>=min)&&(j[1]<=max)) i g=(struct node *)malloc(LEN) g->dx=j[O] g->dy=j[l] if(hh==NULL) hh: else r->next=q r if (p->dy<=y) i g=(struct node *)mallOc (LEN) f (hh==NULL hh=q else r->next-q r s[0]=p->dx [l]=p->d p=p->next} struct node *builyy(h,y) struct node *h; int y; {int s[2],j[2]; struct node *hh,*p,*r,*q; int max,min; p=h; hh=NULL; s[0]=p->dx; s[1]=p->dy; p=p->next; while (p!=NULL) { j[1]=y; j[0]=s[0]+(p->dx-s[0])*(y-s[1])/(p->dy-s[1]+0.1); max=s[1]; min=p->dy; if (s[1]<p->dy) { max=p->dy; min=s[1]; } if ((j[1]>=min)&&(j[1]<=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->dy<=y) { 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; }