Greiner–Hormann clipping algorithm: Difference between revisions

Content deleted Content added

Revision as of 02:24, 16 March 2019 edit Citation bot (talk \| contribs) Bots 5,867,877 edits m Add: doi. \| You can use this bot yourself. Report bugs here. \| User-activated. ← Previous edit		Latest revision as of 05:34, 13 August 2023 edit undo OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: doi added to citation with #oabot.
(One intermediate revision by one other user not shown)
Line 8: \| title = Efficient clipping of arbitrary polygons \| journal = ACM Transactions on Graphics ~~\| accessdate = 2014-05-17~~ \| year = 1998 ~~\| url = http://dl.acm.org/citation.cfm?id=274364~~ \| doi = 10.1145/274363.274364 \| doi-access = free }}</ref> It performs better than the [[Vatti clipping algorithm]], but cannot handle [[Degeneracy (mathematics)\|degeneracies]].<ref>{{Cite web \| title = Efficient Clipping of Arbitrary Polygons