A TWO-DIMENSIONAL CLIPPING DIVIDER

Simple item page
dc.contributor.authorMERIAUX, Michelen_US
dc.contributor.editorK. BO and H.A. TUCKERen_US
dc.date.accessioned2015-09-29T08:29:16Z
dc.date.available2015-09-29T08:29:16Z
dc.date.issued1984en_US
dc.description.abstractThe 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.description.seriesinformationEurographics Conference Proceedingsen_US
dc.identifier.doi10.2312/eg.19841031en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/eg.19841031en_US
dc.publisherThe Eurographics Associationen_US
dc.titleA TWO-DIMENSIONAL CLIPPING DIVIDERen_US
Files
Collections
EG1984 Proceedings (Technical Papers)