OK but I am a little confused.
I always thought it is MUCH harder to find out WHICH triangle a point is
in. If you have a quick algorithm for "is P in [abc]" you still have to
do a search among all the [abc] triangles.
Of course you can narrow down the search by sorting the coordinates of
the mesh points and only testing ones that "span" the point in question.
=
Loren P Meissner
Check it out!
-----Original Message-----
From: Fortran 90 List [mailto:[log in to unmask]] On Behalf
Of Alvaro Fernandez
Sent: Thursday, May 15, 2003 6:04 AM
To: [log in to unmask]
Subject: Re: Slightly OT: Delaunay triangulation
Yes, a way to know if a point is inside a triangle. Once that happens, I
know which triangle to evaluate.
Alvaro
|