🚀 go-pugleaf

On Tue, 20 Oct 1998 07:35:30 -0700, Rich Pasco <pasco@best.com> wrote:

>Arnaud Fietzke <arnaud.fietzke@provi.de> wrote
>
>If you define the area as a polygon, then the point is "in" the area
>if it is on the correct side of each of the sides of the polygon, e.g.
>
>FUNCTION inside(x,y): BOOLEAN;
>  BEGIN
>    inside = (a*x + b*y < c) AND
>             (d*x + e*y > d) AND
>             (f*x + g*y < h) AND ...
>  END;
>
>The example above has three sides (a triangle).
>
So it's a triangle.  We know what x & y are but what exactly are a, b,
c, d, e, f, g, & h? I'm sure you know what you are trying to say but
I'm damned if I do. They can't be ordered pairs describing the
triangle since only 3 pair would be required. I would really like to
understand this algorithm.

It may be cool for C programmers to write obfuscated code but I don't
believe there is any need for it in Pascal.

Bill