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