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:
“You should go to picture-galleries and museums of sculpture to be acted upon, and not to express or try to form your own perfectly futile opinion. It makes no difference to you or the world what you may think of any work of art. That is not the question; the point is how it affects you. The picture is the judge of your capacity, not you of its excellence; the world has long ago passed its judgment upon it, and now it is for the work to estimate you.”
—Anna C. Brackett (1836–1911)