kaden@osiris.CSO.UIUC.EDU (10/18/86)
Can we generalise to determine whether (p1,p2) is inside a polygon? Use the VECTOR approach, ONLY, as it is clearly the most superior, elegant and non- paleozoic approach to the problem. I will not even scan any other precambrian attempts. Thankyou.
levy@ttrdc.UUCP (Daniel R. Levy) (10/20/86)
In article <8900031@osiris>, kaden@osiris.CSO.UIUC.EDU writes: > > Can we generalise to determine whether (p1,p2) is > inside a polygon? Use the VECTOR approach, ONLY, as > it is clearly the most superior, elegant and non- > paleozoic approach to the problem. I will not even > scan any other precambrian attempts. > > > Thankyou. Hey, if you are too hoity toity to look at whatever is offered you (espec- ially for free) don't ask for it. Anybody else, with any method whatsoever to determine if (x,y) is within a polygon (and to make this more interesting, even a degenerate polygon, that is, whose sides cross or touch) please post. -- ------------------------------- Disclaimer: The views contained herein are | dan levy | yvel nad | my own and are not at all those of my em- | an engihacker @ | ployer or the administrator of any computer | at&t computer systems division | upon which I may hack. | skokie, illinois | -------------------------------- Path: ..!{akgua,homxb,ihnp4,ltuxa,mvuxa, go for it! allegra,ulysses,vax135}!ttrdc!levy
wjh@wayback.UUCP (Bill Hery) (10/25/86)
> Can we generalise to determine whether (p1,p2) is > inside a polygon? Use the VECTOR approach, ONLY, as > it is clearly the most superior, elegant and non- > paleozoic approach to the problem. I will not even > scan any other precambrian attempts. > For a convex polygon with vertices at x(i) (i=1,n, x(i) vectors), the set of points inside the polygon is the convex hull of the these points. The convex hull of a finite set of points is precisely those points which can be represented in the form x=sum{x(i)*a(i)}, with sum{a(i)}=1. Bill Hery