Ise r->next=q r-g, if (p->dy>=y) i g=(struct node *)mallOc(LEN) g->dy=p->dy if (hh==NULL) r->next=q r-g, s[0]=p->dx s[1]=p->dy p=p->next [1] 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) max=p->dy min=s[1l if([1]>=min)&(j[1]=max) i g=(struct node *)mallOc(LEN) g->dx=j[O] g->dy=j[l] if (hh==NULL) hh=g else r->next=q r-g if (p->dy>=y) i g=(struct node *)malloc(LEN) g->dy=p->d if (hh==NULL) hh=g else r->next=q r->next=NULL return(hh)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; } p=h; 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; } r->next=NULL; return(hh);