The problem of polygon intersection seeks to determine if two polygons intersect and, if so, possibly determine their intersection. For example, the intersection of the two polygons shown at left is the yellow region in the figure at right.
Polygon Intersection
See also
Polygon, Polygon Clipping, Polygon Tessellation, TriangulationExplore with Wolfram|Alpha
References
O'Rourke, J. Computational Geometry in C, 2nd ed. Cambridge, England: Cambridge University Press, 1998.Mount, D. M. "geometric Intersection." Ch. 33 in Handbook of Discrete and Computational Geometry (Ed. J. E. and J. O'Rourke). Boca Raton, FL: CRC Press, pp. 615-630, 1997.Suri, S. "Polygon Intersection." §23.3 in Handbook of Discrete and Computational Geometry (Ed. J. E. and J. O'Rourke). Boca Raton, FL: CRC Press, pp. 434-435, 1997.Referenced on Wolfram|Alpha
Polygon IntersectionCite this as:
Weisstein, Eric W. "Polygon Intersection." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/PolygonIntersection.html