Planar Convex Hull Algorithms in Theory and Practice
View/
Date
1988Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
Sequential and parallel planar convex hull algorithms, their applications and some of the problems encountered on implementations are described. Details of Pascal implementations are given for three of the sequential algorithms: Graham s, Floyd-Eddy and the Approximation method. The programs are compared experimentally.
BibTeX
@article {10.1111:j.1467-8659.1988.tb00608.x,
journal = {Computer Graphics Forum},
title = {{Planar Convex Hull Algorithms in Theory and Practice}},
author = {Day, A. M.},
year = {1988},
publisher = {Blackwell Publishing Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.1988.tb00608.x}
}
journal = {Computer Graphics Forum},
title = {{Planar Convex Hull Algorithms in Theory and Practice}},
author = {Day, A. M.},
year = {1988},
publisher = {Blackwell Publishing Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.1988.tb00608.x}
}