Greiner–Hormann clipping algorithm: Difference between revisions

Revision as of 04:15, 17 May 2014

Revision as of 04:31, 17 May 2014

Line 1:

The Greiner-Hormann algorithm is anused algorithmin computer graphics for polygon [[Clipping (computer graphics)|clipping]] first published in 1998. <ref>{{Cite journal

| volume = 17

| issue = 2

Line 11:

| date = 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>{{Cite journal

| last = Foster

| first = Erich L.

Line 20:

| date = 2012

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

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

| title = Efficient Clipping of Arbitrary Polygons

| author = Ionel Daniel Stroe

| accessdate = 2014-05-17

| url = http://davis.wpi.edu/~matt/courses/clipping/

}}</ref>

It can process both self-intersecting and non-convex polygons.

==See also==