Greiner–Hormann clipping algorithm
The Greiner-Hormann algorithm is used in computer graphics for polygon clipping.[1] It is more performant than the Vatti clipping algorithm, but cannot handle degeneracies.[2][3] It can process both self-intersecting and non-convex polygons.
See also
- Vatti clipping algorithm
- Sutherland–Hodgman clipping algorithm
- Weiler–Atherton clipping algorithm
- Boolean operations on polygons
References
- ^ Greiner, Günther; Kai Hormann (1998). "Efficient clipping of arbitrary polygons". ACM Transactions on Graphics (TOG). 17 (2): 71–83. Retrieved 2014-05-17.
- ^ Foster, Erich L.; James R. Overfelt (2012). "Clipping of Arbitrary Polygons with Degeneracies". arXiv preprint arXiv:1211.3376. Retrieved 2014-05-17.
- ^ Ionel Daniel Stroe. "Efficient Clipping of Arbitrary Polygons". Retrieved 2014-05-17.
External links
- Geographic Clipping Describes the clipping algorithms in D3.js.
- https://github.com/helderco/univ-polyclip An implementation in Python and Java.
- https://github.com/sjkelly/PolygonClipping.jl An implementation in Julia
 | This computer graphics–related article is a stub. You can help Wikipedia by expanding it. |