Greiner–Hormann clipping algorithm: Difference between revisions

Revision as of 01:42, 8 April 2015

Revision as of 21:06, 30 July 2015

Line 11:

| year = 1998

| url = http://dl.acm.org/citation.cfm?id=274364

}}</ref> It is more performant than the [[Vatti clipping algorithm]], but cannot handle [[Degeneracy (mathematics)|degeneracies]].<ref name="foster">{{Cite journalweb

| last = Foster

| first = Erich L.

|author2=James R. Overfelt

| title = Clipping of Arbitrary Polygons with Degeneracies

| journal = arXiv preprint arXiv:1211.3376

| accessdate = 2014-05-17

| year = 2012

| url = http://arxiv.org/abs/1211.3376

}}</ref><ref>{{Cite web

| title = Efficient Clipping of Arbitrary Polygons

| author = Ionel Daniel Stroe

Line 36 ⟶ 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. Several modifications to handle degeneracy have been proposed in the literature.<ref name="foster"/>

==See also==