A TWO-DIMENSIONAL CLIPPING DIVIDER
View/
Date
1984Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
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.
BibTeX
@inproceedings {10.2312:eg.19841031,
booktitle = {Eurographics Conference Proceedings},
editor = {K. BO and H.A. TUCKER},
title = {{A TWO-DIMENSIONAL CLIPPING DIVIDER}},
author = {MERIAUX, Michel},
year = {1984},
publisher = {The Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/eg.19841031}
}
booktitle = {Eurographics Conference Proceedings},
editor = {K. BO and H.A. TUCKER},
title = {{A TWO-DIMENSIONAL CLIPPING DIVIDER}},
author = {MERIAUX, Michel},
year = {1984},
publisher = {The Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/eg.19841031}
}