From: | Ashley Clarke |
Date: | 4 May 99 at 21:51:27 |
Subject: | [amos-list] Re: Crossing lines, fast. |
From: Ashley Clarke <ashley@a-clarke.demon.co.uk>
On 04-May-99, Andrew Crowe wrote:
>From: Andrew Crowe <andrewcrowe@enterprise.net>
>Hi Everybody,
> I know this was asked a while ago, and I know /I/ answered it, but has
>anyone got a good routine to check if two lines are crossing? Speed *is*
>important, so it can't check it graphically, it /has/ to be mathamatical.
> And also, does anyone know a way to check if a point is in a closed
>polygon of any shape? (you know, like the lasso tool in dpaint)
>See ya.
>--
> Manta Soft - Amiga programing & web page designing
> Http://members.tripod.com/~mantasoft/ ICQ: 21829166
> Homepage updated 29/4/99 --- Bomberman clone major update
> - ------------------- Quote of the day: -------------------- -
>I like work ... I can sit and watch it for hours.
I don't have any routines, but I think you'll find the answers (with examples)
in any
3D Graphics Computer Book. The Crossing Lines Algorythm would be under the
subject
of Vectors (for Ray Tracing) and enclosed points should be dealt with under
the
subjects of Hidden Line removal or Plane definers.
Ashley Clarke <ashley@a-clarke.demon.co.uk>
------------------------------------------------------------------------
The possibilities are endless!
http://www.onelist.com
ONElist has something for everyone!
------------------------------------------------------------------------
Official AMOS WWW: http://members.xoom.com/AmosFactory/front.html