| dc.contributor.author | MERIAUX, Michel | en_US |
| dc.contributor.editor | K. BO and H.A. TUCKER | en_US |
| dc.date.accessioned | 2015-09-29T08:29:16Z | |
| dc.date.available | 2015-09-29T08:29:16Z | |
| dc.date.issued | 1984 | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/eg.19841031 | en_US |
| dc.description.abstract | The clipping problem is the heart of a lot of algorithms to produce computer generated images. Sutherland and Hodgman proposed a reentrant clipping algorithm ; we propose here two solutions to achieve a true two-dimensional line clipping and we apply them to convex polygon clipping. Performance evaluation shows that this parallel solution is much more interesting than the classical sequential one. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | A TWO-DIMENSIONAL CLIPPING DIVIDER | en_US |
| dc.description.seriesinformation | Eurographics Conference Proceedings | en_US |
| dc.identifier.doi | 10.2312/eg.19841031 | en_US |
