Point In Polygon
In computational geometry, the point-in-polygon (PIP) problem asks whether a given point in the plane lies inside, outside, or on the boundary of a polygon. It is a special case of point location problems and finds applications in areas that deal with processing geometrical data, such as computer graphics, computer vision, geographical information systems (GIS), motion planning, and CAD.
An early description of the problem in computer graphics shows two common approaches (ray casting and angle summation) in use as early as 1974.
An attempt of computer graphics veterans to trace the history of the problem and some tricks for its solution can be found in an issue of the Ray Tracing News.
Read more about Point In Polygon: Ray Casting Algorithm, Winding Number Algorithm, Point in Polygon Queries
Famous quotes containing the word point:
“The end of all stories, even if the writer forebears to mention it, is death, which is where time stops short. Sheherezade knew this, which is why she kept on spinning another story out of the bowels of the last one, never coming to a point where she could say: “This is the end.” Because it would have been.”
—Angela Carter (1940–1992)