🚀 go-pugleaf

hi,
I disagree, the method only works for circles, for polygons its a totally
different, method, try the procedures with your own polygons and see if they work
out, try different type sof concave and complex polygons.
These routines are the fastest ever, all they need is ASM interprations and it will
fly.

Arash

Dr John Stockton wrote:

> JRS:  In article <388DB645.15D47762@ihug.com.au> of Wed, 26 Jan 2000
> 01:42:13 in news:comp.lang.pascal.borland, Arash Partow
> <arash@ihug.com.au> wrote:
>
> >Well I 've decided to put back into a community that has helped me out
> >so much over the years.
> >I've developed a set of really fast geometric routines that I would like
> >to share with everyone.
>
> Too many newsgroups, in one of which policy bars crossposts (but only
> applies when sent to the proper server).  FU set to the two relevant
> ones; using the tolerant server.
>
> >Function PntInCircle(Px,Py,x,y,Radius:LongInt):Boolean;
> > Begin
> >  PntInCircle:=False;
> >  If Distance(Px,Py,x,y) <= Radius then PntInCircle:=True
> > End;
>
> Function PntInCircle(Px,Py,x,y,Radius:LongInt):Boolean;
> Begin PntInCircle:= Distance(Px,Py,x,y) <= Radius End;
>
> is all you need; similarly for others.
>
> --
> � John Stockton, Surrey, UK.  jrs@merlyn.demon.co.uk   Turnpike v4.00   MIME. �
>  <URL: http://www.merlyn.demon.co.uk/> TP/BP/Delphi/&c., FAQqy topics & links;
>  <URL: ftp://garbo.uwasa.fi/pc/link/tsfaqp.zip> Timo Salmi's Turbo Pascal FAQ;
>  <URL: http://www.merlyn.demon.co.uk/clpb-faq.txt> Pedt Scragg: c.l.p.b. mFAQ.