Planar Convex Hull Algorithms in Theory and Practice

Simple item page
dc.contributor.authorDay, A. M.en_US
dc.date.accessioned2014-10-21T06:05:14Z
dc.date.available2014-10-21T06:05:14Z
dc.date.issued1988en_US
dc.description.abstractSequential 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.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume7en_US
dc.identifier.doi10.1111/j.1467-8659.1988.tb00608.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages177-193en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1988.tb00608.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titlePlanar Convex Hull Algorithms in Theory and Practiceen_US
Files
Collections
Issue 3