Greiner–Hormann clipping algorithm: Difference between revisions

Revision as of 01:25, 18 May 2014

Revision as of 03:51, 28 May 2014

Line 1:

The '''Greiner-Hormann algorithm''' is used in computer graphics for polygon [[Clipping (computer graphics)|clipping]]. <ref>{{Cite journal

| volume = 17

| issue = 2

Line 9:

| journal = ACM Transactions on Graphics (TOG)

| accessdate = 2014-05-17

| dateyear = 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

Line 18:

| journal = arXiv preprint arXiv:1211.3376

| accessdate = 2014-05-17

| dateyear = 2012

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

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

Line 25:

| 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==

Line 43:

[[Category:Clipping (computer graphics)|*]]

[[Category:Computer graphics]]

{{compu-graphics-stub}}