f (p->dx>=x) I g=(struct node *)malloc(LEn) g->dx=p->dx; g->dy=p->dy if(hh==NULL)hh=q s[0]=p>dx;s[1]=p->dy p-p->next p=h j[0]=x;j[1]=s[1]+(p-dy-s[l])*(x-s[0])/(p->dxs[0]); max=s[O]: min=p->dx if (s[o]p->dx)( max=p->dx: min=s [0]: J if([0]>=min)&(j[0]<=max) I g=(struct node *)malloc(LEn) >dx=j[0] > d if(hh==NULL)hh=q else r->next=q if (p->dx>=x) I g=(struct node *)malloc(LEn) g->dx=p->dx g->dy=p->dy f(hh==NULL) hh=q r->next=q r-g r->next=NULL return (hh) struct node *bui lxx(h, x) struct node *h. {ints[2],j[2] struct node *hh, *kp *r, *ke int max, min hh=NUlL s[0]=p->dx s[1]=p->dyr=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]); 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; } r->next=NULL; return(hh); } struct node *builxx(h,x) struct node *h; int x; {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;