Greiner–Hormann clipping algorithm

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Vatti_clipping_algorithm/TVqPvjA2">Vatti clipping algorithm</a></li>
<li><a href="/facts/Sutherland%E2%80%93Hodgman_clipping_algorithm/WDrYbGUl">Sutherland–Hodgman clipping algorithm</a></li>
<li><a href="/facts/Weiler%E2%80%93Atherton_clipping_algorithm/zHnWENLa">Weiler–Atherton clipping algorithm</a></li>
<li><a href="/facts/Boolean_operations_on_polygons/5lp152nx">Boolean operations on polygons</a></li></ul>

<h2 id="external-links">External links</h2>
<ul><li><a href="http://www.jasondavies.com/maps/clip/">Geographic Clipping</a> Describes the clipping algorithms in <a href="/facts/D3.js/H5xQ0vcu">D3.js</a>.</li>
<li><a href="https://github.com/helderco/univ-polyclip">https://github.com/helderco/univ-polyclip</a> An implementation in Python and Java.</li>
<li><a href="https://github.com/w8r/GreinerHormann">https://github.com/w8r/GreinerHormann</a> An implementation in JavaScript</li>
<li><a href="http://tsusiatsoftware.net/jts/main.html">JTS Topological Suite</a> A topological suite with a Java implementation</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Greiner, Günther; Kai Hormann (1998). "Efficient clipping of arbitrary polygons". ACM Transactions on Graphics. 17 (2): 71–83. doi:10.1145/274363.274364. <a href="https://doi.org/10.1145%2F274363.274364" target="_blank">https://doi.org/10.1145%2F274363.274364</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Ionel Daniel Stroe. "Efficient Clipping of Arbitrary Polygons". Retrieved 2014-05-17. <a href="http://davis.wpi.edu/~matt/courses/clipping/" target="_blank">http://davis.wpi.edu/~matt/courses/clipping/</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

Greiner–Hormann clipping algorithm open-in-new

Greiner–Hormann clipping algorithm