MERIAUX, MichelK. BO and H.A. TUCKER2015-09-292015-09-2919841017-4656https://doi.org/10.2312/eg.19841031The 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.10.2312/eg.19841031