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 essence of being human is that one does not seek perfection, that one is sometimes willing to commit sins for the sake of loyalty, that one does not push asceticism to the point where it makes friendly intercourse impossible, and that one is prepared in the end to be defeated and broken up by life, which is the inevitable price of fastening one’s love upon other human individuals.”
—George Orwell (1903–1950)