Greiner–Hormann clipping algorithm: Difference between revisions

Revision as of 22:02, 12 October 2015

Revision as of 18:42, 13 March 2016

Line 7:

|author2=Kai Hormann

| title = Efficient clipping of arbitrary polygons

| journal = ACM Transactions on Graphics (TOG)

| accessdate = 2014-05-17

| year = 1998

Line 27:

The algorithm is not restricted to polygons and can handle arbitrary [[parametric curve]]s as segments, as long as there is a suitable pairwise intersection procedure.

A major shortcoming of the original Greiner–Hormann algorithm is the fact that it cannot handle degeneracies, such as common edges or intersections exactly at a vertex. The original paper suggests perturbing the vertices to remove them.

==See also==