Article View: sci.math.num-analysis
Article #722in or out of polygon ?
From: 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
Technical Details
Message-ID:
<1992Oct2.162234.11435@news.dfrf.nasa.gov>Path:
arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!ames!news.dfrf.nasa.gov!neon.dfrf.nasa.gov!joepShow Full Headers
Complete Article Headers
Newsgroups: sci.math.num-analysis Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!ames!news.dfrf.nasa.gov!neon.dfrf.nasa.gov!joep From: joep@neon.dfrf.nasa.gov (Joe Pahle) Subject: in or out of polygon ? Message-ID: <1992Oct2.162234.11435@news.dfrf.nasa.gov> Sender: news@news.dfrf.nasa.gov (Usenet news) Reply-To: joep@neon.dfrf.nasa.gov Organization: NASA Ames-Dryden FRF, Edwards, CA Date: Fri, 2 Oct 1992 16:22:34 GMT Lines: 24