Thread View: sci.math.num-analysis
1 messages
1 total messages
Started by Joe Pahle
Fri, 02 Oct 1992 16:22
in or out of polygon ?
Author: Joe Pahle
Date: Fri, 02 Oct 1992 16:22
Date: Fri, 02 Oct 1992 16:22
23 lines
1290 bytes
1290 bytes
Please forgive me for asking what may be a stupid question: Is there a general algorythm for determining if a point [x,y] is interior or exterior to a convex polygon with verticies [x_i,y_i],i=1:n ? In addition, I need to know the min distance to the polygon border holding either x or y fixed, that is, the min distance along a know line. I think I can approach the problem by subdividing into quadrants and using an exaustive search, but I didn't want to re-invent the wheel if a TOMS/ACM/NETLIB alogrythm already exists. I just didn't know what keyword to search for ! Thanks in advance, Joseph W. Pahle F-18 HARV flight controls phone: 805 258-3185 e-mail: joep@neon.dfrf.nasa.gov UUCP: ames!neon.dfrf.nasa.gov!joep Comment: disclaimers attract lawyers ... here boy ! NASA Ames Dryden Flight Research Facility, Edwards,CA
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads